| 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 |
Search results
Create the page "Riesel problem" on this wiki! See also the search results found.
Page title matches
- {{DISPLAYTITLE:Riesel problem, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}}} The '''Riesel problem''' involves determining the smallest [[Riesel number]].6 KB (689 words) - 18:14, 4 April 2024
- Finding primes for the [[Riesel problem 1]]. |category=Riesel problem 12 KB (229 words) - 07:52, 27 March 2024
- {{DISPLAYTITLE:Riesel problem 2, {{Kbn|-|k|2|n}}, {{Num|509203}} < {{Vk}} < {{Num|762701}}}} ...]]s {{Kbn|k|2|n}} for 509203 < {{Vk}} < 762701, the first and second Riesel {{Vk}}-values without any possible primes.4 KB (386 words) - 06:41, 29 March 2024
- Finding primes for the [[Riesel problem 2]]. |titleregexp=Riesel prime 2 [1-9]+1 KB (140 words) - 07:49, 27 March 2024
- {{DISPLAYTITLE:Riesel problem 3, {{Kbn|-|k|2|n}}, {{Num|762701}} < {{Vk}} < {{Num|777149}}}} ...} for {{Num|762701}} < {{Vk}} < {{Num|777149}}, the second and third Riesel {{Vk}}-values without any possible primes.4 KB (347 words) - 04:47, 31 March 2024
- {{DISPLAYTITLE:The Even Riesel Problem}} The [[Riesel problem 1|Riesel problem]] is to find the smallest [[Riesel number]] {{Vk}} (odd) such that {{Kbn|k|2|n}} is composite for every {{Vn}}7 KB (718 words) - 10:32, 26 March 2024
- {{DISPLAYTITLE:Riesel problem 4, {{Kbn|-|k|2|n}}, {{Num|777149}} < {{Vk}} < {{Num|790841}}}} ...} for {{Num|777149}} < {{Vk}} < {{Num|790841}}, the third and fourth Riesel {{Vk}}-values without any possible primes.4 KB (346 words) - 04:53, 31 March 2024
- {{DISPLAYTITLE:Real Riesel problem 1, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}, {{Vb}}<sup>{{Vn}}</sup> > { *not included {{Vk}}-values of the original [[Riesel problem 1|Riesel problem]]938 bytes (122 words) - 12:25, 14 April 2024
Page text matches
- ...]] in search for lowest [[Sierpiński number|Sierpiński]]/[[Riesel number|Riesel]] values.}} ...t '[[Sierpiński number|Sierpiński value]]' (+1 form) or '[[Riesel number|Riesel value]]' (-1 form) that is composite for all values of {{Vn}} ≥ 1. Conje3 KB (503 words) - 04:44, 27 March 2024
- The '''Sierpiński problem''' in [[number theory]] was proposed by [[Wacław Sierpiński]] in 1960. ==The Problem==5 KB (650 words) - 10:25, 26 March 2024
- *[[Riesel problem 1|Riesel problem]] *[[Riesel_2_Riesel|Riesel numbers]]380 bytes (56 words) - 10:27, 26 March 2024
- A '''Riesel number''' is a value of ''k'' such that {{Kbn|k|n}} is always composite for ...the [[Sierpiński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 2 509203|{{Kbn|509203|n}}]] is always composite.827 bytes (112 words) - 08:21, 25 March 2024
- ...Seventeen or Bust|Seventeen or Bust]]: helping to solve the [[Sierpiński problem]]. ...m|Extended Sierpiński Problem]]: helping solve the [[Extended Sierpiński Problem]].3 KB (458 words) - 10:28, 26 March 2024
- The '''Riesel sieve project (RSP)''' is a [[distributed computing]] project. It is now a ...e to find primes for all the remaining k values to prove that they are not Riesel numbers.2 KB (326 words) - 10:29, 26 March 2024
- Using the same method presented in the [[Sierpiński problem]] article, it was found that {{Kbn|+|159986|5|n}} is multiple of 3, 7, 13, ...r not, a [[distributed computing project]] was created named [[Sierpiński-Riesel Base 5]].556 bytes (83 words) - 10:57, 14 October 2020
- A '''Riesel number base 5''' is a value of ''k'' such that {{Kbn|-|k|5|n}} is always a Using the same method presented in the [[Riesel problem 1|Riesel problem]] article, it was found that {{Kbn|-|346802|5|n}} is multiple of 3, 7, 13,589 bytes (90 words) - 10:30, 26 March 2024
- {{DISPLAYTITLE:Riesel problem, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}}} The '''Riesel problem''' involves determining the smallest [[Riesel number]].6 KB (689 words) - 18:14, 4 April 2024
- {{Riesel prime {{HistC|2021-03-04|11438898|PrimeGrid The Riesel Problem}}370 bytes (41 words) - 22:07, 3 August 2021
- Finding primes for the [[Riesel problem 1]]. |category=Riesel problem 12 KB (229 words) - 07:52, 27 March 2024
- {{Riesel prime {{HistF|2017-12-13|8932416|Wolfgang Schwieger,PrimeGrid The Riesel Problem|P#7754}} ([http://www.primegrid.com/download/TRP-273809.pdf Official announ354 bytes (37 words) - 22:03, 3 August 2021
- {{Riesel prime [[Category:Riesel problem real 1]]436 bytes (50 words) - 21:58, 16 April 2024
- Finding primes for the [[Sierpiński number base 5]] problem. *[[PrimeGrid Riesel base 5]]2 KB (245 words) - 11:43, 5 September 2021
- Finding primes for the [[Sierpiński-Riesel_Base_5|Riesel base 5 problem]]. |category=PrimeGrid Riesel base 54 KB (399 words) - 12:42, 2 March 2024
- {{Riesel prime {{HistC|2022-12-22|13977768|PrimeGrid The Riesel Problem}}, released272 bytes (28 words) - 16:03, 22 December 2022
- {{Riesel prime {{HistC|2023-05-09|14510700|PrimeGrid The Riesel Problem}}, released272 bytes (28 words) - 07:18, 10 May 2023
- ...tures regarding the frequency of prime {{Vn}}-values of a given parity for Riesel and Proth {{Vk}}-values divisible by 3. The notion that certain {{Vk}}-valu :{{Kbn|k|n}} is composite for all even {{Vn}} for {{Vk}}=[[Riesel prime 2 39939|39939]]2 KB (360 words) - 10:31, 26 March 2024
- ...iskovets-Gallot conjectures]], which relate to the smallest [[Riesel prime|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes f ...ic factorizations.<ref>[https://www.primepuzzles.net/problems/prob_036.htm Problem 36] "The Liskovets-Gallot numbers" from [https://www.primepuzzles.net/index7 KB (957 words) - 22:40, 10 June 2023
- {{Riesel prime {{HistF|2011-04-05|3629342|Adrian Schori,PrimeGrid The Riesel Problem}} ([http://www.primegrid.com/download/trp-65531.pdf Official announcement])312 bytes (34 words) - 21:58, 3 August 2021
