paper

Prime values of a sparse polynomial sequence

arXiv:2111.05403

Abstract

A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the number of primes of the shape where is small.

arXiv comment80 pages, to appear in Duke Math J

References in corpus (1)