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.

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

• 2015-06-13: Found Riesel 19401•2^3086450-1, Gary Barnes
• 2011-07-29: Found Riesel 148323•2^1973319-1, Max Dettweiler
• 2008-12-03: Found Riesel 30003•2⁶¹³⁴⁶³-1, Karsten Bonath
• 2008-05-22: Found Riesel 6927•2⁷⁴³⁴⁸¹-1, Gary Barnes

Links

• Bases 2 & 4 reservations/statuses/primes at MersenneForum
• PRPnet 1st drive-R/S base 2 even-k/even-n/odd-n Thread at MersenneForum