Large prime factors on short intervals

From MaRDI portal
Publication:4958675

DOI10.1017/S0305004119000306zbMATH Open1486.11113arXiv1805.05123OpenAlexW2802300069MaRDI QIDQ4958675FDOQ4958675


Authors: Jori Merikoski Edit this on Wikidata


Publication date: 14 September 2021

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Abstract: We show that for all large enough x the interval [x,x+x1/2log1.39x] contains numbers with a prime factor p>x18/19. Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the same problem for the longer intervals [x,x+x1/2+epsilon]. We also incorporate some ideas from Harman's book `Prime-detecting sieves' (2007). The main new ingredient that we use is the iterative argument of Matom"aki and Radziwi{l}{l}(2016) for bounding Dirichlet polynomial mean values, which is applied to obtain Type II information. This allows us to take shorter intervals than in the above-mentioned previous works. We have also had to develop ideas to avoid losing any powers of logx when applying Harman's sieve method.


Full work available at URL: https://arxiv.org/abs/1805.05123




Recommendations




Cites Work






This page was built for publication: Large prime factors on short intervals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958675)