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 "Prime number" on this wiki! See also the search results found.
- ...GIMPS]] with occasional ECM curves and PRP-CF tests, as well as some other prime-searching projects. *[https://github.com/happy5214/rps Riesel Prime Results]835 bytes (107 words) - 20:41, 30 April 2024
- ...bn|+|k|n}} are simultaneously prime, which means they form a set of [[twin prime]]s. The data file can be found [[:File:Twin prime least k.csv|here]].993 bytes (142 words) - 09:00, 28 May 2021
- '''Paul Leyland''' is a British [[number theory|number theorist]] who has studied [[factorization]] and [[primality test]]ing. ...numbers of the form <math>x^y + y^x</math>, which are now called [[Leyland number]]s.839 bytes (122 words) - 20:22, 19 July 2019
- {{Leyland prime {{HistF|2014-07-19|number|Mark Rodenkirch|378541}}210 bytes (22 words) - 08:23, 7 August 2019
- Short list of all available [[Leyland number]]s sorted by digits in csv format (Date: {{CURRENTYEAR}}-{{CURRENTMONTH}}-{ |category=Leyland prime P468 bytes (64 words) - 08:17, 22 June 2020
- A '''Leyland number''' is a number that can be expressed in the form <math>x^y+y^x</math>, where x and y are p A '''Leyland prime''' is a Leyland number which is also a [[prime]] (see {{OEIS|l|A094133}}).8 KB (906 words) - 09:59, 5 January 2023
- ! No. !! n !! Digits !! Number !! Normalized form !! Discoverer !! Date | 1 || 1 || 1 || {{Kbn|2|1}} || [[Riesel prime 2 1|{{Kbn|2}}]] || n.n. || n.n.4 KB (327 words) - 16:31, 31 August 2021
- ! No. !! {{Vn}} !! Digits !! Number !! Normalized form !! Discoverer !! Date | 1 || 2 || 1 || {{Kbn|1|2}} || [[Riesel prime 2 1|{{Kbn|2}}]]<ref>Mersenne prime [[M1]]</ref> || n.n. || n.n.3 KB (313 words) - 16:51, 31 August 2021
- *Name: [[Riesel Prime Search]] Drive 10 ! data-sort-type="number" class="fixhead" | {{Vk}}-value3 KB (398 words) - 17:46, 26 June 2024
- {{Riesel prime const |RcRemarks=514229 is the 29th [[Fibonacci number]].371 bytes (30 words) - 09:02, 11 March 2020
- |DRProject=Riesel Prime Search *To identify a post of the MersennForum thread the date and post number are given.4 KB (432 words) - 07:15, 8 July 2024
- {{Riesel prime {{HistC|2012-02-21|'''1019935''' not prime|Brian Lody|290227}}, number was proved [https://primes.utm.edu/primes/page.php?id=104867&deleted=1 comp1 KB (136 words) - 05:23, 14 March 2023
- {{Riesel prime {{HistC|2012-02-21|'''1019049''' not prime|Brian Lody|290227}}, number was proved [https://primes.utm.edu/primes/page.php?id=104866&deleted=1 comp1 KB (133 words) - 05:30, 14 March 2023
- Finding primes for the [[Sierpiński number base 5]] problem. |include={Proth prime}:Pk,{Proth prime}:Pk3 KB (265 words) - 06:08, 8 June 2024
- Riesel numbers {{Kbn|k|n}} with 100 or more prime values {{Vn}}. include={Riesel prime}:Rk,{Riesel prime}:RCount,n100,{Riesel prime}:RNash,maxn911 bytes (120 words) - 21:56, 25 July 2021
- include={Riesel prime}:Rk,{Riesel prime}:Rk,{Riesel prime}:RCount,{Riesel prime}:RNash,a ...head"|Count!!data-sort-type="number" class="fixhead"|Nash!!data-sort-type="number" class="fixhead"|Max {{Vn}},\n¦-,,\n¦}1 KB (156 words) - 06:59, 16 July 2021
- include={Riesel prime}:Rk,{Riesel prime}:Rk,{Riesel prime}:RCount,{Riesel prime}:RNash,a ...head"|Count!!data-sort-type="number" class="fixhead"|Nash!!data-sort-type="number" class="fixhead"|Max-{{Vn}},\n¦-,,\n¦}1 KB (156 words) - 07:01, 16 July 2021
- include={Riesel prime}:Rk,{Riesel prime}:Rk,{Riesel prime}:RCount,{Riesel prime}:RNash,a ...head"|Count!!data-sort-type="number" class="fixhead"|Nash!!data-sort-type="number" class="fixhead"|Max {{Vn}},\n¦-,,\n¦}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
- ...ctures]], which relate to the smallest [[Riesel prime|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes for {{Vn}}-values of ...sted {{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 proven8 KB (1,001 words) - 14:05, 2 June 2024