On the largest prime factor of n^2 + 1

DOI10.4171/JEMS/1216MaRDI QIDQ6160168zbMATH OpenOpenAlexWikidataFDO

Authors Jori Merikoski

Publication date 9 May 2023

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

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

zbMATH Keywords

sieve methodsprime numbers

Mathematics Subject Classification ID

Distribution of primes (11N05) Applications of sieve methods (11N36)

Abstract: We show that the largest prime factor of $n^2+1$ is infinitely often greater than $n^{1.279}$. This improves the result of de la Bret`eche and Drappeau (2019) who obtained this with $1.2182$ in place of $\mathrm{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 $\mathrm{1.312.}$

Recommendations

• Le plus grand facteur premier de n² + 1 où est presque premier
• Integers of the form \(n^ 2+1\) without large prime factors
• On the greatest prime factor of \((n^2)+1\)
• On values of \(n^2 + 1\) free of large prime factors
• On the largest square divisor of shifted primes

Cites work

• Almost all short intervals containing prime numbers
• Almost-primes represented by quadratic polynomials
• Almost-primes represented by quadratic polynomials
• Equidistribution of roots of a quadratic congruence to prime moduli
• Functoriality for the exterior square of 𝐺𝐿₄ and the symmetric fourth of 𝐺𝐿₂
• Kloosterman sums and Fourier coefficients of cusp forms
• Level of distribution of quadratic polynomials and an upper bound sieve for friable integers
• On the greatest prime factor of \((n^2)+1\)
• On the greatest prime factor of a quadratic polynomial
• Opera de cribro
• Prime-detecting sieves

Cited in

(7)

• On the Greatest and Least Prime Factors of n !+1
• On values of \(n^2 + 1\) free of large prime factors
• On the largest prime factor of $x^{2}-1$
• Integers of the form \(n^ 2+1\) without large prime factors
• Two problems on the greatest prime factor of \(n^2+1\)
• On the prime factors of the number 2^p-1 - 1
• 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)