3
$\begingroup$

Let $P(n)$ denote the largest prime factor of $n$. I wanted to know if an analogue of Baker-Harman estimate for smooth shifted primes in arithmetic progressions with fixed moduli is there in literature.

Baker-Harman proved that there exist infinitely many primes $p$ such that $P(p-1)<p^{0.2961}$ and the exponent was recently improved to $0.2844$ by Lichtman recently. Has someone considered the problem of obtaining an inifnitude of such primes which are of form $1\pmod{a}$ for some fixed modulus $a$?

Thanks in advance for any help.

$\endgroup$
2
  • $\begingroup$ It should be said that the improvement to $0.2844$ is due to Lichtman (arxiv.org/abs/2211.09641). $\endgroup$ Commented Jun 20, 2023 at 13:00
  • $\begingroup$ @ThomasBloom I have edited the post. Thank you for your comment. $\endgroup$ Commented Jun 20, 2023 at 13:23

1 Answer 1

1
$\begingroup$

The only relevant result I found is a paper by Banks, Harcharras, and Shparlinski. They did not establish existence of such smooth numbers but instead gave an upper bound.

Let

$$ \pi_h(x,y;q,a)=\#\{p\le x:P(p-h)<y\wedge p\equiv a\pmod q\}. $$

Then uniformly for $x\ge y\ge2$ and $q\ge1$, they proved that

$$ \pi_h(x,y;q,a)\ll{u\rho(u)\over\varphi(q)}\prod_{\substack{p|h\\p>2}}{p-1\over p-2}\pi(x). $$

$\endgroup$
2
  • $\begingroup$ I had seen this paper before. I would like to point out that in a recent email exchange, I received a confirmation by Lichtman that the approach of Baker-Harman or his can be modified to include the case of fixed modulus. $\endgroup$ Commented Jun 20, 2023 at 13:25
  • $\begingroup$ I did find Lichtman's paper during the search while writing the answer. As I did not have communications with him before about such generalizations, I did not put his result in the answer. $\endgroup$
    – TravorLZH
    Commented Jun 20, 2023 at 13:50

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .