Talk:Twin primes: Difference between revisions
Brun's Theorem
(Deja vu all over again) |
(Brun's Theorem) |
||
Line 3:
== Deja vu all over again ==
Did we not cover and become bored with this with Successive prime differences and Sexy Primes plus a further one the name of which I forget which was deleted as we had had enough?--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:38, 27 July 2020 (UTC)
== Brun's Theorem Exention? ==
Even though the task currently isn't testing the conjecture, it prompted me to read about the it on the Wikipedia.
<br><br>
I see that that Viggo Brun proved that the sum of the reciprocols of the twin primes converges as the twin primes approach infinity.
<br>
Testing this lead to the discovery of the division bug in the early Pentium chips by Thomas Nicely (according the Wikipedia page on Brun's Theorem).
<br><br>
It would be simple to add calculating the sum of the reciprocols of the twin primes. The sum is thought to approximate 1.902.... Apparently convergence is *very* slow. I didn't get very close to that with twins up to 10 000 000.<br>
NB: 5 is the only prime in two twin pairs.
<br><br>
--[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 14:53, 27 July 2020 (UTC)
<br><br>
| |||