On the largest prime factor of n^2 + 1

From MaRDI portal
Publication:6160168

DOI10.4171/JEMS/1216zbMATH Open1521.11056arXiv1908.08816OpenAlexW4214601118WikidataQ114021486 ScholiaQ114021486MaRDI QIDQ6160168FDOQ6160168


Authors: Jori Merikoski Edit this on Wikidata


Publication date: 9 May 2023

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Abstract: We show that the largest prime factor of n2+1 is infinitely often greater than n1.279. This improves the result of de la Bret`eche and Drappeau (2019) who obtained this with 1.2182 in place of 1.279. The main new ingredients in the proof are a new Type II estimate and using this estimate by applying Harman's sieve method. To prove the Type II estimate we use the bounds of Deshouillers and Iwaniec on linear forms of Kloosterman sums. We also show that conditionally on Selberg's eigenvalue conjecture the exponent 1.279 may be increased to 1.312.


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




Recommendations




Cites Work


Cited In (7)





This page was built for publication: On the largest prime factor of \(n^2 + 1\)

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