| 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 numbers" on this wiki! See also the search results found.
- ...Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are one less than a power of two; hence, ...umber|even]] perfect numbers have this form. No [[odd number|odd]] perfect numbers are known, and it is suspected that none exists.5 KB (857 words) - 14:53, 19 September 2021
- *[[Riesel Prime Search]] *[[Sierpiński-Riesel Base 5]]2 KB (293 words) - 17:33, 5 July 2019
- Consider numbers of the form {{V|N}} = {{Kbn|+|k|n}}, where {{Vk}} is odd and {{Vn}} > 0. If ...ence {{Kbn|+|78557|n}} can be prime. The same arguments can be said of the numbers 271129, 271577, 322523, 327739, 482719, 575041, 603713, 903983, 934909, 9655 KB (650 words) - 10:25, 26 March 2024
- ...'''covering set''' for a sequence of integers refers to a set of [[prime]] numbers such that every term in the sequence is divisible by at least one member of *[[Riesel problem 1|Riesel problem]]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
- ==Primality tests for numbers {{V|N}} with special form== *[[LLR|Lucas–Lehmer–Riesel test]]: Used for [[Riesel prime]]s.3 KB (501 words) - 05:20, 3 August 2021
- ...Primality testing program|program]] available to perform primality test on numbers of the form {{Vk}}•2<sup>{{Vn}}</sup>±{{V|c}}. *the fastest algorithms are for base two numbers (with {{Vk}} < 2<sup>{{Vn}}</sup>):2 KB (300 words) - 22:00, 16 December 2023
- John Cosgrave has studied the following numbers: Numbers of the form: <math>F_{n,r} = \sum_{i=0}^{p-1} \ 2^{i p^{n}} \ = \ 2^{(p-1)p5 KB (726 words) - 09:57, 12 September 2021
- ...Grid''' is a [[distributed computing]] project for searching for [[prime]] numbers of world-record size. It makes use of the [[BOINC|Berkeley Open Infrastruct ...ierpiński base 5|Sierpiński base 5]]: helping to solve the [[Sierpiński-Riesel Base 5]] Problem.3 KB (458 words) - 10:28, 26 March 2024
- The '''Riesel sieve project (RSP)''' is a [[distributed computing]] project. It is now a ...nd primes for all the remaining k values to prove that they are not Riesel numbers.2 KB (326 words) - 10:29, 26 March 2024
- ...<sup>{{Vn}}</sup> > {{Vk}}, all odd integers greater than 1 would be Proth numbers, but most pages lists them, too. ...nd [[Fermat number]]s ({{Kbn|+|2<sup>n</sup>}}) are special forms of Proth numbers.670 bytes (104 words) - 10:59, 9 July 2021
- ...o ensure validity of [[Proth prime|Proth]] tests and PRP tests on base-2 [[Riesel prime]] candidates, and by those programs and [[PRST]] in an extended versi ...um.org/showthread.php?t=22510 Original proposal of the technique for Proth numbers]3 KB (528 words) - 14:59, 3 October 2023
- '''Tutorial to LLR (Lucas Lehmer Riesel) and PRP:''' [[LLR]] is a program used to prove primality of numbers. It can be rather slow (but faster if you support [[SSE2]]), and that's why2 KB (337 words) - 13:24, 20 February 2019
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with Nash weight < 1000}} Riesel numbers {{Kbn|k|n}} where the [[Nash weight]] is smaller than 1000.948 bytes (121 words) - 13:08, 21 July 2021
- The most recent iteration of the project searched for prime numbers of the form {{Kbn|k|1290000}}, for ''k'' ≤ 10<sup>13</sup>. The first version of the project searched for prime numbers {{Kbn|k|n}} for 666,666 ≤ ''n'' ≤ 666,691 with varying ranges of ''k''3 KB (337 words) - 15:13, 16 December 2023
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}}}} ...are odd numbers {{Vk}} for which {{Kbn|k|n}} is composite for all natural numbers {{Vn}}.808 bytes (110 words) - 21:12, 17 December 2023
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with 100 and more primes}} Riesel numbers {{Kbn|k|n}} with 100 or more prime values {{Vn}}.911 bytes (120 words) - 21:56, 25 July 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with {{Vk}} mod 15 = 0}} Riesel numbers {{Kbn|k|n}} where {{Vk}}-value is a multiple of 15.1 KB (156 words) - 06:59, 16 July 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with {{Vk}} mod 2145 = 0}} Riesel numbers {{Kbn|k|n}} where {{Vk}}-value is a multiple of 2145.1 KB (156 words) - 07:01, 16 July 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with {{Vk}} mod 2805 = 0}} Riesel numbers {{Kbn|k|n}} where {{Vk}}-value is a multiple of 2805.1 KB (156 words) - 07:08, 16 July 2021
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with no prime value so far}} Riesel numbers {{Kbn|k|n}} where no prime values are known.871 bytes (117 words) - 21:46, 25 March 2024
- ...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 [[Yves Gallot]] extended this for {{Kbn|k|n}} numbers and gave also the first solutions as:2 KB (367 words) - 12:42, 9 May 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 ...w.primepuzzles.net/problems/prob_036.htm Problem 36] "The Liskovets-Gallot numbers" from [https://www.primepuzzles.net/index.shtml PP&P connection] by [[Carlo7 KB (957 words) - 22:40, 10 June 2023
- {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with {{Vk}} mod 3 = 0}} Riesel numbers {{Kbn|k|n}} where {{Vk}}-value is a multiple of 3.1 KB (153 words) - 06:55, 16 July 2021
- ...n}}]] || {{Vk}}-value || style="text-align:right;"|{{Num|{{PAGESINCATEGORY:Riesel 2|pages|R}}}} ...>2 || base || style="text-align:right;"|{{Num|{{#expr:{{PAGESINCATEGORY:Riesel prime|subcats|R}}-3}}}}11 KB (1,385 words) - 17:23, 5 April 2024
- {{Riesel prime |RRemarks=All numbers are [[Near Repdigit]] 999199...99.516 bytes (41 words) - 13:45, 19 July 2021
- *Create own template to calculate indexes for long numbers, see [[Riesel k=3k value]] *expand more prime templates like Riesel prime template790 bytes (110 words) - 09:54, 9 October 2020
- {{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
- {{Riesel prime .../prime/prime_difficulty.txt List of near-repdigit-related (probable) prime numbers Studio Kamada] (see wlabel=99929w)763 bytes (88 words) - 00:11, 30 April 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 (337 words) - 18:52, 30 April 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
- {{Riesel prime ...4747-X/S0025-5718-1972-0314747-X.pdf H.C.Williams, C.R.Zarnke: "Some prime numbers of the forms 2A3^n+1 and 2A3^n-1"] Math. Comp. 26 (1972), 995-998<br>The {{4 KB (449 words) - 06:55, 30 May 2023
- {{Riesel prime ...4747-X/S0025-5718-1972-0314747-X.pdf H.C.Williams, C.R.Zarnke: "Some prime numbers of the forms 2A3^n+1 and 2A3^n-1"] Math. Comp. 26 (1972), 995-998<br>The {{4 KB (400 words) - 13:39, 16 March 2023
- {{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 (336 words) - 18:50, 30 April 2024
