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
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 is infinitely often greater than . This improves the result of de la Bret`eche and Drappeau (2019) who obtained this with in place of 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 may be increased to
Full work available at URL: https://arxiv.org/abs/1908.08816
Recommendations
Cites Work
- Kloosterman sums and Fourier coefficients of cusp forms
- Opera de cribro
- Functoriality for the exterior square of 𝐺𝐿₄ and the symmetric fourth of 𝐺𝐿₂
- Almost-primes represented by quadratic polynomials
- Prime-detecting sieves
- On the greatest prime factor of \((n^2)+1\)
- Equidistribution of roots of a quadratic congruence to prime moduli
- Almost all short intervals containing prime numbers
- On the greatest prime factor of a quadratic polynomial
- Almost-primes represented by quadratic polynomials
- Level of distribution of quadratic polynomials and an upper bound sieve for friable integers
Cited In (7)
- On the greatest prime factor of \((n^2)+1\)
- On the prime factors of the number 2p-1 - 1
- On the Greatest and Least Prime Factors of n !+1
- Integers of the form \(n^ 2+1\) without large prime factors
- On values of \(n^2 + 1\) free of large prime factors
- On the largest prime factor of $x^{2}-1$
- Two problems on the greatest prime factor of \(n^2+1\)
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)