Quadratic polynomials at prime arguments
Abstract
For a fixed quadratic irreducible polynomial f with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes p such that f(p) has at most 4 prime factors, improving a classical result of Richert who requires 5 in place of 4. Denoting by P+(n) the greatest prime factor of n, it is also proved that P+(f(p))>p0.847 infinitely often.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.