Almost-prime values of reducible polynomials at prime arguments
arXiv:1812.11280 · doi:10.1016/j.jnt.2019.09.013
Abstract
We adopt A. J. Irving's sieve method to study the almost-prime values produced by products of irreducible polynomials evaluated at prime arguments. This generalizes the previous results of Irving and Kao, who separately examined the almost-prime values of a single irreducible polynomial evaluated at prime arguments.
15 pages