Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quadratic polynomials at prime arguments

Published 23 Mar 2016 in math.NT | (1603.07067v3)

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))>p{0.847}$ infinitely often.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.