Two problems on the greatest prime factor of n^2+1
From MaRDI portal
Let \(P^+(m)\) denote the greatest prime factor of the positive integer \(m\). In the paper under review, the author shows that\N\[\N\#\{n\leq x : P^+(n^2+1)<x^\alpha\}\gg x\N\]\Nfor \(\alpha\geq 0.567\).
Recommendations
Cites work
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- A new form of the error term in the linear sieve
- An asymptotic formula for the number of smooth values of a polynomial
- Functoriality for the exterior square of 𝐺𝐿₄ and the symmetric fourth of 𝐺𝐿₂
- scientific article; zbMATH DE number 3943948 (Why is no real title available?)
- scientific article; zbMATH DE number 3708485 (Why is no real title available?)
- scientific article; zbMATH DE number 3512236 (Why is no real title available?)
- scientific article; zbMATH DE number 4123827 (Why is no real title available?)
- Integers of the form \(n^ 2+1\) without large prime factors
- Level of distribution of quadratic polynomials and an upper bound sieve for friable integers
- On primitive divisors of n^2 + b
- On the greatest prime factor of \((n^2)+1\)
- On the greatest prime factor of a quadratic polynomial
- On the largest prime factor of n^2 + 1
- On two theorems of Gelfond and some of their applications
- On values of \(n^2 + 1\) free of large prime factors
- Primes Generated by Recurrence Sequences
- Smooth values of polynomials
- Some problems of Partitio numerorum. III: On the expression of a number as a sum of primes.
Cited in
(2)
This page was built for publication: Two problems on the greatest 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 Q6547206)
