Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the largest square divisor of shifted primes (1907.02246v3)

Published 4 Jul 2019 in math.NT

Abstract: We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d2 \geq p\theta$ for $\theta=1/2+1/2000.$ This improves the work of Matom\"aki (2009) who obtained the result for $\theta=1/2-\varepsilon$ (with the added constraint that $d$ is also a prime), which improved the result of Baier and Zhao (2006) with $\theta=4/9-\varepsilon.$ Similarly as in the work of Matom\"aki, we apply Harman's sieve method to detect primes $p \equiv 1 \, (d2)$. To break the $\theta=1/2$ barrier we prove a new bilinear equidistribution estimate modulo smooth square moduli $d2$ by using a similar argument as Zhang (2014) used to obtain equidistribution beyond the Bombieri-Vinogradov range for primes with respect to smooth moduli. To optimize the argument we incorporate technical refinements from the Polymath project (2014). Since the moduli are squares, the method produces complete exponential sums modulo squares of primes which are estimated using the results of Cochrane and Zheng (2000).

Summary

We haven't generated a summary for this paper yet.