Asymptotics for primality of sum of three consecutive primes - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-20T20:58:27Z http://mathoverflow.net/feeds/question/72536 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/72536/asymptotics-for-primality-of-sum-of-three-consecutive-primes Asymptotics for primality of sum of three consecutive primes Raj 2011-08-10T01:50:42Z 2011-08-10T21:24:05Z <p>We consider the sequence $R_n=p_n+p_{n+1}+p_{n+2}$, where ${p_i}$ is the prime number sequence, with $p_0=2$, $p_1=3$, $p_2=5$, etc..</p> <p>The first few values of $R_n$ are: 10, 15, 23, 31, 41, 49, 59, 71, 83, 97, 109, 121, 131, 143, 159, 173, 187, 199, 211, 223, 235, 251, 269, 287, 301, 311, 319, 329, 349, 371, 395, 407, 425, 439, 457, ...</p> <p>Now, we define $R(n)$ to be the number of prime numbers in the set ${R_0, R_1 , \dots , R_n}$.</p> <p>What I have found (without justification) is that $R(n) \approx \frac{2n}{\ln (n)}$.</p> <p>My lack of programming skills, however, prevents me from checking further numerical examples. I was wondering if anyone here had any ideas as to how to prove this assertion.</p> <p>As a parting statement, I bring up a quote from Gauss, which I feel describes many conjectures regarding prime numbers: "I confess that Fermat's Theorem as an isolated proposition has very little interest for me, because I could easily lay down a multitude of such propositions, which one could neither prove nor dispose of."</p> http://mathoverflow.net/questions/72536/asymptotics-for-primality-of-sum-of-three-consecutive-primes/72539#72539 Answer by GH for Asymptotics for primality of sum of three consecutive primes GH 2011-08-10T02:13:11Z 2011-08-10T02:50:54Z <p>I believe proving (or disproving) such a statement is beyond current technology. On the other hand, by a crude heuristics the conjecture must be right: $R_1,\dots,R_n$ are $n$ odd numbers up to $\sim 3n\ln(n)$ which are rather evenly distributed in size and in residue classes. In this range the density of primes among odd numbers is $\sim 2/\ln(n)$, so $R(n)$ should be $\sim 2n/\ln(n)$.</p> <p><strong>EDIT:</strong> As Noam Elkies points out in a comment below, there should be a fine tuning similar to the twin prime constant.</p> http://mathoverflow.net/questions/72536/asymptotics-for-primality-of-sum-of-three-consecutive-primes/72545#72545 Answer by Álvaro Lozano-Robledo for Asymptotics for primality of sum of three consecutive primes Álvaro Lozano-Robledo 2011-08-10T04:21:35Z 2011-08-10T10:36:37Z <p>For what it's worth, I calculated a bunch of values of $R(n)$ and the claimed densities. I also had into consideration Noam Elkies' possible correction to the factor of $2$ (i.e., use $\lambda n/\log(n)$ instead of $2n/\log(n)$, where $\lambda = \prod_l (1+1/(l-1)^3)\cong 2.30096\ldots$; see the comments in GH's answer). $$n \quad|\quad R(n) \quad | \quad 2n/\log(n) \quad | \quad (2.30096)n/\log(n)$$ $$10 \quad | \quad 7 \quad | \quad 8.685\ldots \quad | \quad 9.992\ldots$$ $$100 \quad | \quad 44 \quad | \quad 43.429\ldots \quad | \quad 49.964\ldots$$ $$1000 \quad | \quad 339 \quad | \quad 289.529\ldots \quad | \quad 333.098\ldots$$ $$10000 \quad | \quad 2437 \quad | \quad 2171.472\ldots\quad | \quad 2498.235\ldots$$ $$100000 \quad | \quad 18892 \quad | \quad 17371.779\ldots \quad | \quad 19985.884\ldots$$</p> http://mathoverflow.net/questions/72536/asymptotics-for-primality-of-sum-of-three-consecutive-primes/72558#72558 Answer by joriki for Asymptotics for primality of sum of three consecutive primes joriki 2011-08-10T06:17:52Z 2011-08-10T17:44:13Z <p>I verified Noam's calculation of the factor $\lambda=2.30096\ldots$ and Álvaro's computations, extended the latter and calculated the corresponding ratios:</p> <p>$$\begin{array}{|c|c|c|c|c|} n &amp; R(n) &amp; 2n/\log n &amp; \lambda n / \log n &amp; R(n)\log n/n\\ \hline 10 &amp; 7 &amp; 9 &amp; 10 &amp; 1.61181\\ 100 &amp; 44 &amp; 43 &amp; 50 &amp; 2.02627\\ 1000 &amp; 339 &amp; 290 &amp; 333 &amp; 2.34173\\ 10000 &amp; 2437 &amp; 2171 &amp; 2498 &amp; 2.24456\\ 100000 &amp; 18892 &amp; 17372 &amp; 19986 &amp; 2.17502\\ 1000000 &amp; 157183 &amp; 144765 &amp; 166549 &amp; 2.17156\\ 10000000 &amp; 1346797 &amp; 1240841 &amp; 1427564 &amp; 2.17078\\ 30000000 &amp; 3784831 &amp; 3484987 &amp; 4009410 &amp; 2.17208\\ \end{array}$$</p> <p>(The values in the third and fourth columns are rounded to the nearest integer, the values in the last column are rounded to 5 digits after the decimal point.)</p> <p>I don't think we can deduce anything from the ratio in this form, however, since it shows convergence in the "random" fluctuations but not with respect to the asymptotic approximations made, e.g. dropping a term $\log\log n$, which at this stage is still comparable to $\log n$; a more detailed analysis will be required to test the independence hypothesis in this case.</p> <p>[<em>Update:</em>] With reference to Noam's comments below, here are some data for the relative frequencies of the sum of three consecutive primes being divisible by the first four odd primes. These are averaged over samples of $400,000$ primes beginning at powers of ten, which are given in the first column; note that these refer to the numbers $x$ themselves, not the indices $n$ of the primes.</p> <p>$$\begin{array}{|c|c|c|c|c|} \log_{10}x&amp;3&amp;5&amp;7&amp;11\\ \hline 8 &amp;0.183&amp;0.165&amp;0.130&amp;0.087\\ 9 &amp;0.189&amp;0.169&amp;0.131&amp;0.087\\ 10&amp;0.195&amp;0.170&amp;0.133&amp;0.087\\ 11&amp;0.198&amp;0.172&amp;0.133&amp;0.088\\ 12&amp;0.203&amp;0.173&amp;0.133&amp;0.088\\ 13&amp;0.208&amp;0.175&amp;0.134&amp;0.087\\ \hline \text{limit?}&amp;0.250&amp;0.188&amp;0.139&amp;0.090 \end{array}$$</p> <p>I also looked at the joint distribution of the residues modulo $3$ for the three primes. There's a significant preference for avoiding repeated residues; for instance, at $x=10^9$, the repeating patterns $1,1,1$ and $2,2,2$ have relative frequencies around $0.095$, the alternating patterns $1,2,1$ and $2,1,2$ have relative frequencies around $0.150$, and the remaining mixed patterns have relative frequencies around $0.128$, which is almost completely explained by $1,1$ and $2,2$ having relative frequencies $0.445$ and $1,2$ and $2,1$ having relative frequencies $0.555$. I'm trying to work out a probabilistic model for these effects.</p>