| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "CRUS Liskovets-Gallot"
(As demonstrated with the {{HistLink}} experiment, string parser functions don't work with parameters generated by this extension.) |
(Expanding) |
||
| Line 1: | Line 1: | ||
| − | |||
'''CRUS Liskovets-Gallot''' is a [[Conjectures 'R Us]] (CRUS) subproject aiming to prove the [[Liskovets-Gallot conjectures]], which relate to the smallest [[Riesel prime|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes for {{Vn}}-values of a given parity. | '''CRUS Liskovets-Gallot''' is a [[Conjectures 'R Us]] (CRUS) subproject aiming to prove the [[Liskovets-Gallot conjectures]], which relate to the smallest [[Riesel prime|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes for {{Vn}}-values of a given parity. | ||
==Explanations== | ==Explanations== | ||
:''Main article: [[Liskovets-Gallot conjectures]]'' | :''Main article: [[Liskovets-Gallot conjectures]]'' | ||
| + | [[Valery Liskovets]] first observed in 2001 that some {{Vk}}-values, divisible by 3, had few prime {{Vn}}-values of a given parity. He then conjectured that there existed {{Vk}}-values (initially for [[Proth prime]]s, then also for [[Riesel prime]]s), divisible by 3, that had no primes of a given parity. This was proven by [[Yves Gallot]], who provided examples for all four cases (Riesel/Proth, even/odd). Gallot further conjectured that these four examples are the smallest such {{Vk}}-values of each type, not including algebraic factorizations.<ref>[https://www.primepuzzles.net/problems/prob_036.htm Problem 36] "The Liskovets-Gallot numbers" from [https://www.primepuzzles.net/index.shtml PP&P connection] by [[Carlos Rivera]]</ref> | ||
| − | == | + | This subproject is attempting to prove the latter set of conjectures by finding primes for {{Vn}}-values of the required sign (Riesel/Proth) and parity (even/odd). The process is the same as [[PrimeGrid|PrimeGrid's]] subprojects for [[PrimeGrid The Riesel Problem|The Riesel Problem]] and [[PrimeGrid Seventeen or Bust|Seventeen or Bust]]. |
| + | |||
| + | ==History== | ||
| + | This subproject was founded by Conjectures 'R Us in January 2008, as an extension of the base 4 Riesel and Sierpiński problems. The initial search was led by [[Jean Penné]] and [[Gary Barnes]], and [https://www.rieselprime.de/Related/LiskovetsGallot.htm a page for the effort] was created on the [[Riesel and Proth Prime Database]] on January 11. | ||
| + | |||
| + | The even Proth conjecture was proven on 2015-08-02, by Penné, and the discovery was made public a day later after a personal double-check.<ref name="Even Proth proof">[https://www.mersenneforum.org/showpost.php?p=407149 A Liskovets-Gallot theorem proven!] by [[Jean Penné]], 2015-08-02</ref> | ||
| + | |||
| + | ==Current status== | ||
===Riesel values=== | ===Riesel values=== | ||
| − | *[[Riesel prime 2 9519|{{Vk}}=9519 | + | ====Even {{Vn}}'s==== |
| − | *[[Riesel prime 2 14361|{{Vk}}=14361 | + | *[[Riesel prime 2 9519|{{Vk}}=9519]], done to {{Vn}}=16777216, even {{Vn}}, not reserved |
| − | *[[Riesel prime 2 39687|{{Vk}}=39687 | + | *[[Riesel prime 2 14361|{{Vk}}=14361]] |
| − | *[[Riesel prime 2 103947|{{Vk}}=103947 | + | |
| − | *[[Riesel prime 2 154317|{{Vk}}=154317 | + | ====Odd {{Vn}}'s==== |
| − | *[[Riesel prime 2 163503|{{Vk}}=163503 | + | *[[Riesel prime 2 39687|{{Vk}}=39687]] |
| + | *[[Riesel prime 2 103947|{{Vk}}=103947]] | ||
| + | *[[Riesel prime 2 154317|{{Vk}}=154317]] | ||
| + | *[[Riesel prime 2 163503|{{Vk}}=163503]] | ||
===Proth values=== | ===Proth values=== | ||
| − | *[[Proth prime 2 9267|{{Vk}}=9267 | + | ====Even {{Vn}}'s==== |
| − | *[[Proth prime 2 32247|{{Vk}}=32247 | + | :''The even {{Vn}} conjecture was proven in August 2015.''<ref name="Even Proth proof"/> |
| − | *[[Proth prime 2 53133|{{Vk}}=53133 | + | |
| + | ====Odd {{Vn}}'s==== | ||
| + | *[[Proth prime 2 9267|{{Vk}}=9267]], reserved by [[Jean Penné]] | ||
| + | *[[Proth prime 2 32247|{{Vk}}=32247]] | ||
| + | *[[Proth prime 2 53133|{{Vk}}=53133]] | ||
| − | == | + | ==Primes found== |
===Riesel=== | ===Riesel=== | ||
====Even {{Vn}}'s==== | ====Even {{Vn}}'s==== | ||
| Line 63: | Line 77: | ||
===Proth=== | ===Proth=== | ||
| + | |||
| + | {{reflist}} | ||
==Links== | ==Links== | ||
Revision as of 14:22, 5 April 2022
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
Valery Liskovets first observed in 2001 that some k-values, divisible by 3, had few prime n-values of a given parity. He then conjectured that there existed k-values (initially for Proth primes, then also for Riesel primes), divisible by 3, that had no primes of a given parity. This was proven by Yves Gallot, who provided examples for all four cases (Riesel/Proth, even/odd). Gallot further conjectured that these four examples are the smallest such k-values of each type, not including algebraic factorizations.[1]
This subproject is attempting to prove the latter set of conjectures by finding primes for n-values of the required sign (Riesel/Proth) and parity (even/odd). The process is the same as PrimeGrid's subprojects for The Riesel Problem and Seventeen or Bust.
History
This subproject was founded by Conjectures 'R Us in January 2008, as an extension of the base 4 Riesel and Sierpiński problems. The initial search was led by Jean Penné and Gary Barnes, and a page for the effort was created on the Riesel and Proth Prime Database on January 11.
The even Proth conjecture was proven on 2015-08-02, by Penné, and the discovery was made public a day later after a personal double-check.[2]
Current status
Riesel values
Even n's
Odd n's
Proth values
Even n's
- The even n conjecture was proven in August 2015.[2]
Odd n's
- k=9267, reserved by Jean Penné
- k=32247
- k=53133
Primes found
Riesel
Even n's
The data file can be found here.
Odd n's
The data file can be found here.
Proth
Notes
- ↑ Problem 36 "The Liskovets-Gallot numbers" from PP&P connection by Carlos Rivera
- ↑ 2.0 2.1 A Liskovets-Gallot theorem proven! by Jean Penné, 2015-08-02
