Almost-Prime Polynomials with Prime Arguments
Number Theory
2016-06-14 v1
Abstract
We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of prime factors of irreducible polynomials at prime arguments. In particular, we prove that irreducible quadratics over satisfying necessary local conditions are infinitely often.
Cite
@article{arxiv.1606.03505,
title = {Almost-Prime Polynomials with Prime Arguments},
author = {Pin-Hung Kao},
journal= {arXiv preprint arXiv:1606.03505},
year = {2016}
}
Comments
17 pages, 4 tables