| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Florian Baur"
(Created page with "Currently working on Proth primes of the form <math>1281979*2^n+1</math>. Sieving for <math>100,000 <= n <= 4,100,000</math> was done up to <math>P = 314*10^{12}</math>, resu...") |
m (Karbon moved page (bur) to Florian Baur without leaving a redirect: renamed) |
(No difference)
| |
Revision as of 10:59, 10 March 2021
Currently working on Proth primes of the form [math]\displaystyle{ 1281979*2^n+1 }[/math].
Sieving for [math]\displaystyle{ 100,000 \lt = n \lt = 4,100,000 }[/math] was done up to [math]\displaystyle{ P = 314*10^{12} }[/math], resulting in 66,237 candidates.
The Proth prime tests run on a Ryzen 9 3900X and are expected to finish around september 2021, hopefully with at least one Top5000 prime found.
I plan to check the Riesel side after that.
