Quadratic polynomials at prime arguments

preprint2016arXivOpen access

Abstract

For a fixed quadratic irreducible polynomial ff with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes pp such that f(p)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)P^+(n) the greatest prime factor of nn, it is also proved that P+(f(p))>p0.847P^+(f(p))>p^{0.847} infinitely often.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.