Quadratic polynomials at prime arguments
From MaRDI portal
Abstract: For a fixed quadratic irreducible polynomial with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes such that has at most 4 prime factors, improving a classical result of Richert who requires 5 in place of 4. Denoting by the greatest prime factor of , it is also proved that infinitely often.
Recommendations
- Prime-generating quadratic polynomials
- On prime values of some quadratic polynomials
- Quadratics Representing Primes
- Quadratic Polynomials which have a High Density of Prime Values
- Almost-primes represented by quadratic polynomials
- On primes represented by quadratic polynomials.
- On prime values of reducible quadratic polynomials
- Quadratic Non-Residues and Prime-Producing Polynomials
- The representation of primes by quadratic and cubic polynomials
Cites work
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- A higher-dimensional sieve method. With procedures for computing sieve functions
- A new form of the error term in the linear sieve
- Almost-prime values of polynomials at prime arguments
- Almost-primes represented by quadratic polynomials
- Almost-primes represented by quadratic polynomials
- Arithmetic exponent pairs for algebraic trace functions and applications
- Bounded gaps between primes
- Hyperbolic prime number theorem
- Le plus grand facteur premier de n² + 1 où est presque premier
- On the greatest prime factor of \((n^2)+1\)
- On the greatest prime factor of a quadratic polynomial
- Opera de cribro
- Selberg's sieve with weights
- The square sieve and consecutive square-free numbers
- Über die mittlere Verteilung der Werte zahlentheoretischer Funktionen auf Restklassen. II
Cited in
(14)- Operator algebras associated with multiplicative convolutions of arithmetic functions
- On the least common multiple of polynomial sequences at prime arguments
- On prime values of reducible quadratic polynomials
- Prime factors of values of polynomials
- On prime values of some quadratic polynomials
- Arithmetic exponent pairs for algebraic trace functions and applications
- Towards representations of primes by polynomials
- scientific article; zbMATH DE number 5831758 (Why is no real title available?)
- scientific article; zbMATH DE number 6863893 (Why is no real title available?)
- Smooth values of polynomials
- A quadratic analogue of Titchmarsh divisor problem
- Almost-prime polynomials at prime arguments
- Almost-prime values of reducible polynomials at prime arguments
- Almost-prime values of polynomials at prime arguments
This page was built for publication: Quadratic polynomials at prime arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510024)