| 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 |
CRUS Liskovets-Gallot
|
This article is only a stub. You can help PrimeWiki by expanding it. |
CRUS Liskovets-Gallot is a Conjectures 'R Us (CRUS) subproject aiming to prove the Liskovets-Gallot conjectures, which relate to the smallest Riesel and Proth k-values, divisible by 3, with no primes for n-values of a given parity.
Contents
Explanations
- Main article: Liskovets-Gallot conjectures
Status
Riesel values
- k=9519, even n, done to n=16777216, even n, not reserved
- k=14361, even n
- k=39687, odd n
- k=103947, odd n
- k=154317, odd n
- k=163503, odd n
Proth values
- k=9267, odd n, reserved by Jean Penné
- k=32247, odd n
- k=53133, odd n
History
Riesel
Even n's
The data file can be found here.
Odd n's
- 2011-07-29: Found Riesel 148323•21973319-1, Max Dettweiler
- 2008-12-03: Found Riesel 30003•2613463-1, Karsten Bonath
- 2008-05-22: Found Riesel 6927•2743481-1, Gary Barnes
