Papers
Topics
Authors
Recent
Search
2000 character limit reached

Almost-prime values of polynomials at prime arguments

Published 13 Oct 2014 in math.NT | (1410.3333v1)

Abstract: We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the degree is large, there are infinitely many primes $p$ for which $f(p)$ has at most $\deg f+O(\log\deg f)$ prime factors.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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 (1)

Collections

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