Almost-prime values of polynomials at prime arguments
Number Theory
2017-05-17 v1
Abstract
We consider almost-primes of the form where is an irreducible polynomial over and runs over primes. We improve a result of Richert for polynomials of degree at least . In particular we show that, when the degree is large, there are infinitely many primes for which has at most prime factors.
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