Sequences with Large Numbers of Prime Value

From MaRDI portal





Let \((a_ n)\) be a sequence of pairwise different positive integers, and let \(A(x)\) be the number of \(a_ n\) such that \(a_ n\leq x\). It is shown (1) that if \(\lim_{x\to\infty} A(x)/\log x=\infty\), then for every integer \(N\) there exists a positive integer \(c=c(N)\) such that \(a_ n+c\) represents more than \(N\) primes. It is also shown (2) that if \(\limsup_{x\to\infty}\{A(2x)-A(x)\}/\log x=\infty\), then for every integer \(N\) there exists a positive integer \(c=c(N)\) such that \(a_ n-c\) represents more than \(N\) primes. It is a corollary that if \(P(x)\) is a polynomial of degree \(m\geq 1\) with integer coefficients and positive leading coefficient, then for every positive \(N\) there exists an integer \(c=c(N)\) such that \(P(x)+c\) is a prime for more than \(N\) integers \(x\). However, \textit{R. Forman} [Am. Math. Mon. 99, 548-557 (1992; Zbl 0774.11054)] had previously obtained the theorem (1) above, and had shown that if \(f\) is any nonconstant polynomial with positive leading coefficient then for any \(N\) there are infinitely many integers \(c\geq 0\) such that the sequence \([f(n)]+c\), \(n=0,1,2,\dots\), contains at least \(N\) primes.











This page was built for publication: Sequences with Large Numbers of Prime Value

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4039071)