Curious conjectures on the distribution of primes among the sums of the first 2n primes

From MaRDI portal
Publication:6300239

arXiv1804.04198MaRDI QIDQ6300239FDOQ6300239

Romeo Meštrović

Publication date: 6 April 2018

Abstract: Let pn be nth prime, and let (Sn)n=1infty:=(Sn) be the sequence of the sums of the first 2n consecutive primes, that is, Sn=sumk=12npk with n=1,2,ldots. Heuristic arguments supported by the corresponding computational results suggest that the primes are distributed among sequence (Sn) in the same way that they are distributed among positive integers. In other words, taking into account the Prime Number Theorem, this assertion is equivalent to �egin{equation*}�egin{split} &# {p:, p,,{ m is,,a,, prime,, and},, p=S_k ,,{ m for,,some,,} k ,,{ m with,,} 1le kle n} sim & # {p:, p,,{ m is,,a,, prime,, and},, p=k ,,{ m for,,some,,} k ,,{ m with,,} 1le kle n}simfrac{log n}{n},, { m as},, n oinfty, end{split}end{equation*} where |S| denotes the cardinality of a set S. Under the assumption that this assertion is true (Conjecture 3.3), we say that (Sn) satisfies the Restricted Prime Number Theorem. Motivated by this, in Sections 1 and 2 we give some definitions, results and examples concerning the generalization of the prime counting function pi(x) to increasing positive integer sequences. The remainder of the paper (Sections 3-7) is devoted to the study of mentioned sequence (Sn). Namely, we propose several conjectures and we prove their consequences concerning the distribution of primes in the sequence (Sn). These conjectures are mainly motivated by the Prime Number Theorem, some heuristic arguments and related computational results. Several consequences of these conjectures are also established.













This page was built for publication: Curious conjectures on the distribution of primes among the sums of the first $2n$ primes

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