| 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 "Proth prime 11" on this wiki! See also the search results found.
Page title matches
- {{Proth prime |Pk=112 KB (240 words) - 08:58, 11 January 2023
- {{Proth prime |Pb=11313 bytes (27 words) - 09:51, 12 July 2021
Page text matches
- ...1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math></pre> ...1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math>11 KB (1,236 words) - 14:41, 3 September 2020
- ...ese factorisations can be found at [http://www.prothsearch.com/fermat.html Prime Factors of Fermat Numbers] ...</sup> + 1 ≡ 0 (mod 2<sup>{{V|a}}</sup> + 1).) In other words, every prime of the form {{Kbn|+|n}} is a Fermat number, and such primes are called '''F12 KB (1,913 words) - 14:35, 9 August 2021
- {{Proth prime 11432 bytes (32 words) - 13:38, 2 January 2023
- {{Proth prime {{HistC|2022-12-11|660000|(Alex_soldier)}}334 bytes (32 words) - 15:12, 27 January 2023
- *{{Kbn|+|78557|12n+11}} is multiple of 13. |0||1||2||3||4||5||6||7||8||9||10||11||12||13||14||15||16||17||18||19||20||21||22||23||24||25||26||27||28||29||305 KB (650 words) - 10:25, 26 March 2024
- |latest=4.0.5<br/><small>2023-11-11</small> It is written by [[Jean Penné]] and uses a recent release (30.11) of [[George Woltman]]'s [[gwnum]] library, to do fast multiplications and2 KB (300 words) - 22:00, 16 December 2023
- ...g project|distributed computing project]] in search of the largest [[Proth prime]]s. | New prime1 KB (182 words) - 08:17, 12 July 2020
- ...2^{2p^n}+2^{p^n}+1 \ = \ (2^{p^{n+1}}-1)/(2^{p^n}-1)</math> where p is the prime of apparition rank r (r(2)=1, r(3)=2, r(5)=3, ...) and n is greater or equa #If number <math>\sum_{i=0}^{p-1}\ (2^i)^{m} \ </math> is prime, then <math>m=p^n</math>.5 KB (726 words) - 09:57, 12 September 2021
- Although there's no official definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk ...1-4199"]: [https://www.mersenneforum.org/showpost.php?p=425962 #1 (2016-02-11)] - [https://www.mersenneforum.org/showpost.php?p=541048 #7 (2020-03-27)]2 KB (279 words) - 03:48, 24 April 2024
- {{Proth prime {{HistF|2020-10-25|16408818|James Scott Brown,PrimeGrid 321 Prime Search|561613}} ([https://www.primegrid.com/download/321-16408818.pdf Offic3 KB (336 words) - 16:58, 15 April 2024
- {{Proth prime {{HistF|2012-11-10|5775996|Martyn Elvy,PrimeGrid Proth Prime Search}} ([http://www.primegrid.com/download/PPS-5775996.pdf Official annou2 KB (267 words) - 21:47, 5 July 2023
- {{Proth prime 11;T:G3 KB (432 words) - 18:48, 9 April 2023
- {{Proth prime |Pk=112 KB (240 words) - 08:58, 11 January 2023
- {{Proth prime {{HistF|2005-11-14|1861732|Peter Grobstich}}1 KB (175 words) - 07:07, 25 August 2021
- {{Proth prime {{HistF|2012-11-25|2785940|Serge Batalov}}3 KB (390 words) - 10:00, 25 August 2021
- {{Proth prime {{HistF|2005-02-11|853546|Joseph Bohanon}}1 KB (145 words) - 09:32, 26 August 2021
- {{Proth prime 11371 bytes (31 words) - 08:06, 18 September 2021
- {{Proth prime {{HistF|2013-03-18|1777488|Matt Jurach,PrimeGrid Proth Prime Search}}328 bytes (32 words) - 13:00, 12 August 2021
- {{Proth prime {{HistF|2014-06-11|3570132|Fabrice Le Foulher,PrimeGrid Proth Mega Prime Search}} ([https://www.primegrid.com/download/mega-3570132.pdf Official ann2 KB (202 words) - 11:31, 31 August 2021
- {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|b|n}}, least ''n''-values}} Here are shown the least ''n'' ≥ 1 generating a [[Proth prime]] of the form {{Kbn|+|k|b|n}} for 2 ≤ ''b'' ≤ 1030 and 2 ≤ ''k'' ≤7 KB (789 words) - 11:31, 26 October 2023
