| 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 by base" on this wiki! See also the search results found.
- *[[Riesel Prime Search]] *[[Sierpiński-Riesel Base 5]]2 KB (294 words) - 20:11, 11 August 2024
- ...Primality testing program|program]] available to perform primality test on numbers of the form {{Vk}}•2<sup>{{Vn}}</sup>±{{V|c}}. It is written by [[Jean Penné]] and uses a recent release (30.11) of [[George Woltman]]'s [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 (774 words) - 07:39, 27 May 2024
- ...g''' is a technique to verify validity of primality tests. It was proposed by [[Robert Gerbicz]] at [[MersenneForum]] in August 2017. ...ime|Proth]] tests and PRP tests on base-2 [[Riesel prime]] candidates, and by those programs and [[PRST]] in an extended version for PRP tests on additio3 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
- ...[[Riesel prime|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes for {{Vn}}-values of a given parity. ...t numbers" from [https://www.primepuzzles.net/index.shtml PP&P connection] by [[Carlos Rivera]]</ref>8 KB (1,001 words) - 14:05, 2 June 2024
