| 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 "Conjectures 'R Us"
m |
(change link to project vs. problem & standardize Sierpinski project name references) |
||
| (11 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
| − | '''Conjectures 'R Us''' (called '''CRUS''' in short) was established in 2007 by | + | __TOC__ |
| + | {{Shortcut|CRUS|Conjectures 'R Us: a [[Distributed computing project]] in search for lowest [[Sierpiński number|Sierpiński]]/[[Riesel number|Riesel]] values.}} | ||
| + | '''Conjectures 'R Us''' (called '''CRUS''' in short) was established in 2007 by [[Gary Barnes]]. | ||
==Project definition== | ==Project definition== | ||
| − | For every base ( | + | For every base ({{Vb}} ≤ 1030) for the forms {{Kbn|±|k|b|n}} there is a {{Vk}}-value for each form that has been conjectured to be the lowest '[[Sierpiński number|Sierpiński value]]' (+1 form) or '[[Riesel number|Riesel value]]' (-1 form) that is composite for all values of {{Vn}} ≥ 1. Conjectures must have a finite covering set. {{Vk}}-values are not considered in instances where all {{Vn}}'s are covered by one trivial factor, all {{Vn}}'s are covered by algebraic factors or a combination of algebraic and trivial factor(s), or make [[Generalized Fermat number]]'s. |
| − | == | + | ==Sub-project #1== |
| − | Assist in proving the [[Liskovets-Gallot conjectures]] for the forms | + | Assist in proving the [[Liskovets-Gallot conjectures]] for the forms {{Kbn|±|k|2|n}} where {{Vn}} is always odd '''and''' where {{Vn}} is always even. |
| − | == | + | ==Sub-project #2== |
| − | Assist in proving the | + | Assist in proving the Sierpiński base 2 2nd conjecture for the form {{Kbn|+|k|2|n}}. |
| + | |||
| + | The 1st conjectured {{Vk}} where all {{Vn}} are proven composite is {{Vk}}=78557 and is extensively tested by the [[PrimeGrid Seventeen or Bust]] project. | ||
| + | |||
| + | The 2nd conjectured {{Vk}} where all {{Vn}} are proven composite is {{Vk}}=271129. The range of 78557 < {{Vk}} < 271129 has been extensively tested by the [[PrimeGrid Prime Sierpiński Problem]] and the [[PrimeGrid Extended Sierpiński Problem]] projects. All of these projects have omitted even {{Vk}}'s from testing. For the 1st conjecture there are no even {{Vk}}'s remaining. For the 2nd conjecture some even {{Vk}}'s remain. Therefore CRUS is testing even {{Vk}}'s for the Sierp base 2 2nd conjecture. | ||
| + | |||
| + | ==Sub-project #3== | ||
| + | Assist in proving the [[Riesel problem 1|Riesel problem]] and prove the [[2nd Riesel Problem]] for the form {{Kbn|-|k|2|n}}. | ||
| + | |||
| + | The 1st conjectured {{Vk}} where all {{Vn}} are proven composite is {{Vk}}=509203 and is extensively tested by the [[PrimeGrid The Riesel Problem|PrimeGrid Riesel Problem]] project. | ||
| + | |||
| + | The 2nd conjectured {{Vk}} where all {{Vn}} are proven composite is {{Vk}}=762701. The 1st conjecture project has omitted even k's from testing and some even k's remain. The 2nd conjecture has not previously been tested. Therefore the [[CRUS Even Riesel]] project is testing even {{Vk}}'s for the Riesel base 2 1st conjecture and the CRUS project is testing all {{Vk}}'s for the Riesel base 2 2nd conjecture. | ||
==Goal== | ==Goal== | ||
| − | Prove the conjectures by finding at least one prime for all lower values of | + | Prove the conjectures by finding at least one prime for all lower values of {{Vk}}. Many of the conjectures have already been proven but much more work is needed to prove additional bases. Proving them all is not possible but we aim to prove many of them. |
==External links== | ==External links== | ||
| Line 18: | Line 31: | ||
*[http://www.noprimeleftbehind.net/crus/tab/CRUS_tab.htm Condensed table] | *[http://www.noprimeleftbehind.net/crus/tab/CRUS_tab.htm Condensed table] | ||
*[https://primes.utm.edu/bios/page.php?id=1372 Project] at [https://primes.utm.edu/ The Prime Pages] | *[https://primes.utm.edu/bios/page.php?id=1372 Project] at [https://primes.utm.edu/ The Prime Pages] | ||
| − | [[Category: | + | {{Navbox Projects}} |
| + | [[Category:Conjectures 'R Us| ]] | ||
Latest revision as of 04:44, 27 March 2024
Contents
Conjectures 'R Us (called CRUS in short) was established in 2007 by Gary Barnes.
Project definition
For every base (b ≤ 1030) for the forms k•bn±1 there is a k-value for each form that has been conjectured to be the lowest 'Sierpiński value' (+1 form) or 'Riesel value' (-1 form) that is composite for all values of n ≥ 1. Conjectures must have a finite covering set. k-values are not considered in instances where all n's are covered by one trivial factor, all n's are covered by algebraic factors or a combination of algebraic and trivial factor(s), or make Generalized Fermat number's.
Sub-project #1
Assist in proving the Liskovets-Gallot conjectures for the forms k•2n±1 where n is always odd and where n is always even.
Sub-project #2
Assist in proving the Sierpiński base 2 2nd conjecture for the form k•2n+1.
The 1st conjectured k where all n are proven composite is k=78557 and is extensively tested by the PrimeGrid Seventeen or Bust project.
The 2nd conjectured k where all n are proven composite is k=271129. The range of 78557 < k < 271129 has been extensively tested by the PrimeGrid Prime Sierpiński Problem and the PrimeGrid Extended Sierpiński Problem projects. All of these projects have omitted even k's from testing. For the 1st conjecture there are no even k's remaining. For the 2nd conjecture some even k's remain. Therefore CRUS is testing even k's for the Sierp base 2 2nd conjecture.
Sub-project #3
Assist in proving the Riesel problem and prove the 2nd Riesel Problem for the form k•2n-1.
The 1st conjectured k where all n are proven composite is k=509203 and is extensively tested by the PrimeGrid Riesel Problem project.
The 2nd conjectured k where all n are proven composite is k=762701. The 1st conjecture project has omitted even k's from testing and some even k's remain. The 2nd conjecture has not previously been tested. Therefore the CRUS Even Riesel project is testing even k's for the Riesel base 2 1st conjecture and the CRUS project is testing all k's for the Riesel base 2 2nd conjecture.
Goal
Prove the conjectures by finding at least one prime for all lower values of k. Many of the conjectures have already been proven but much more work is needed to prove additional bases. Proving them all is not possible but we aim to prove many of them.
