English

Almost-prime values of polynomials at prime arguments

Number Theory 2017-05-17 v1

Abstract

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

Keywords

Cite

@article{arxiv.1410.3333,
  title  = {Almost-prime values of polynomials at prime arguments},
  author = {A. J. Irving},
  journal= {arXiv preprint arXiv:1410.3333},
  year   = {2017}
}

Comments

17 pages

R2 v1 2026-06-22T06:21:37.642Z