Editing Formula for primes (section)

==Plouffe's formulas==
In 2018 [[Simon Plouffe]] [[conjecture]]d a set of formulas for primes. Similarly to the formula of Mills, they are of the form

:<math>\left\{a_0^{r^n}\right\}</math>

where <math>\{\ \}</math> is the function rounding to the nearest integer. For example, with <math>a_0\approx 43.80468771580293481</math> and <math>r=5/4</math>, this gives 113, 367, 1607, 10177, 102217... {{OEIS|A323176}}. Using <math>a_0=10^{500}+961+\varepsilon</math> and <math>r=1.01</math> with <math>\varepsilon</math> a certain number between 0 and one half, Plouffe found that he could generate a sequence of 50 [[probable primes]] (with high probability of being prime). Presumably there exists an ε such that this formula will give an infinite sequence of actual prime numbers. The number of digits starts at 501 and increases by about 1% each time.<ref>{{citation
 | last = Steckles | first = Katie
 | date = January 26, 2019
 | journal = New Scientist
 | title = Mathematician's record-beating formula can generate 50 prime numbers
 | url = https://www.newscientist.com/article/mg24132143-200-mathematicians-record-beating-formula-can-generate-50-prime-numbers/}}</ref><ref>{{cite arXiv |last1=Simon Plouffe |title=A set of formulas for primes |eprint=1901.01849 |class=math.NT |year=2019 |mode=cs2}} As of January 2019, the number he gives in the appendix for the 50th number generated is actually the 48th.</ref>