| 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 prime" on this wiki! See also the search results found.
Page title matches
- {{Proth prime432 bytes (32 words) - 13:38, 2 January 2023
- {{Proth prime498 bytes (31 words) - 13:34, 2 January 2023
- {{Proth prime334 bytes (32 words) - 15:12, 27 January 2023
- ...oth prime]]s and some others subjects like [[Aliquot sequence]]s or [[Home prime]]s. *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Database main page]380 bytes (59 words) - 14:14, 24 January 2019
- {{Proth prime581 bytes (64 words) - 19:18, 5 April 2023
- ...in the form {{Kbn|+|k|n}} with 2<sup>''n''</sup> > ''k'' are often called Proth primes. *[[Proth's theorem]]656 bytes (91 words) - 07:02, 31 August 2020
- {{Proth prime212 bytes (30 words) - 15:35, 2 October 2022
- {{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 prime1 KB (144 words) - 11:12, 24 August 2021
- {{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
- Automatically generated table from available [[:Category:Proth prime|Proth primes]]. category=Category:Proth 2750 bytes (108 words) - 14:39, 12 July 2021
- {{Proth prime {{HistC|2024-04-30|5000000|PrimeGrid Proth Prime Search}}3 KB (456 words) - 04:11, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}2 KB (248 words) - 08:42, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}2 KB (197 words) - 08:36, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}3 KB (412 words) - 08:00, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}1 KB (149 words) - 04:18, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}1 KB (153 words) - 04:17, 15 May 2024
- {{Proth prime371 bytes (31 words) - 08:06, 18 September 2021
- {{Proth prime {{HistC|2024-04-30|5000000|PrimeGrid Proth Prime Search}}1 KB (129 words) - 09:06, 14 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}913 bytes (102 words) - 03:04, 15 May 2024
- {{Proth prime {{HistC|2024-02-29|4500000|PrimeGrid Proth Prime Search}}470 bytes (49 words) - 09:13, 14 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}2 KB (210 words) - 02:44, 15 May 2024
- {{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 (795 words) - 08:03, 5 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}3 KB (299 words) - 01:29, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}1 KB (111 words) - 00:53, 15 May 2024
- {{Proth prime {{HistF|2022-11-24|3824348|James Scott Brown,PrimeGrid Proth Prime Search}}3 KB (263 words) - 10:10, 14 May 2024
- {{Proth prime {{HistC|2022-07-31|3322000|PrimeGrid Proth Prime Search}}3 KB (315 words) - 09:37, 14 May 2024
- {{Proth prime {{HistF|2022-03-24|3218214|Florian Baur,PrimeGrid Proth Prime Search}}2 KB (194 words) - 00:52, 15 May 2024
- {{Proth prime {{HistC|2024-02-29|4500000|PrimeGrid Proth Prime Search}}2 KB (186 words) - 04:31, 14 May 2024
- {{Proth prime {{HistC|2022-07-31|3322000|PrimeGrid Proth Prime Search}}1 KB (116 words) - 09:29, 14 May 2024
- {{Proth prime1 KB (19 words) - 16:07, 11 July 2021
- {{Proth prime1 KB (19 words) - 16:09, 11 July 2021
- {{Proth prime1 KB (124 words) - 08:43, 12 July 2021
- {{Proth prime631 bytes (65 words) - 08:21, 12 July 2021
- {{Proth prime681 bytes (56 words) - 15:43, 11 July 2021
- {{Proth prime122 bytes (13 words) - 10:23, 12 July 2021
- {{Proth prime561 bytes (72 words) - 17:14, 13 August 2021
- {{Proth prime545 bytes (60 words) - 14:28, 7 April 2023
- {{Proth prime694 bytes (77 words) - 15:44, 11 July 2021
- {{Proth prime318 bytes (34 words) - 15:42, 11 July 2021
- {{Proth prime115 bytes (12 words) - 13:33, 12 July 2021
- {{Proth prime114 bytes (12 words) - 13:22, 12 July 2021
- {{Proth prime398 bytes (29 words) - 15:58, 11 July 2021
- {{Proth prime ...y part of [[Multi Reservation:25|Multi Reservation 25]]: [[PrimeGrid Proth Prime Search Extended]].1 KB (161 words) - 09:08, 10 May 2024
- {{Proth prime608 bytes (65 words) - 07:12, 3 February 2024
- {{Proth prime555 bytes (60 words) - 07:11, 3 February 2024
- {{Proth prime ...to be the smallest odd {{Vk}} ≡ 0 mod 3 for which {{Kbn|+|k|n}} is never prime for an even {{Vn}}. See [[Liskovets-Gallot conjectures]].396 bytes (50 words) - 09:17, 10 May 2024
- {{Proth prime ...lue seems the smallest {{Vk}} ≡ 0 mod 3 for which {{Kbn|+|k|n}} is never prime for an odd {{Vn}}. See [[Liskovets-Gallot conjectures]].457 bytes (43 words) - 15:52, 11 July 2021
- {{Proth prime403 bytes (36 words) - 09:59, 12 July 2021
- {{Proth prime459 bytes (40 words) - 09:57, 12 July 2021
- {{Proth prime582 bytes (53 words) - 10:16, 12 July 2021
- {{Proth prime561 bytes (36 words) - 08:44, 23 July 2021
- {{Proth prime657 bytes (66 words) - 08:33, 12 July 2021
- {{Proth prime115 bytes (12 words) - 13:33, 12 July 2021
- {{Proth prime115 bytes (12 words) - 13:34, 12 July 2021
- {{Proth prime114 bytes (12 words) - 13:23, 12 July 2021
- {{Proth prime314 bytes (35 words) - 08:43, 10 April 2023
- {{Proth prime310 bytes (35 words) - 08:44, 10 April 2023
- {{Proth prime122 bytes (13 words) - 10:27, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:28, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:32, 12 July 2021
- {{Proth prime {{HistF|2017-09-17|19375200|Ben Maloney,PrimeGrid Prime Sierpiński Problem}}225 bytes (24 words) - 15:53, 11 July 2021
- {{Proth prime123 bytes (13 words) - 10:33, 12 July 2021
- {{Proth prime124 bytes (13 words) - 11:12, 12 July 2021
- {{Proth prime124 bytes (13 words) - 11:12, 12 July 2021
- {{Proth prime124 bytes (13 words) - 11:08, 12 July 2021
- {{Proth prime124 bytes (13 words) - 11:06, 12 July 2021
- {{Proth prime123 bytes (13 words) - 11:05, 12 July 2021
- {{Proth prime123 bytes (13 words) - 11:04, 12 July 2021
- {{Proth prime123 bytes (13 words) - 11:04, 12 July 2021
- {{Proth prime123 bytes (13 words) - 11:03, 12 July 2021
- {{Proth prime123 bytes (13 words) - 11:01, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:57, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:56, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:56, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:55, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:54, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:54, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:46, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:44, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:42, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:41, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:40, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:39, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:38, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:36, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:36, 12 July 2021
- {{Proth prime123 bytes (13 words) - 10:35, 12 July 2021
- {{Proth prime114 bytes (12 words) - 13:16, 12 July 2021
- {{Proth prime115 bytes (12 words) - 13:17, 12 July 2021
- {{Proth prime115 bytes (12 words) - 13:18, 12 July 2021
- {{Proth prime115 bytes (12 words) - 13:18, 12 July 2021
- {{Proth prime116 bytes (12 words) - 13:19, 12 July 2021
- {{Proth prime116 bytes (12 words) - 13:19, 12 July 2021
- {{Proth prime116 bytes (12 words) - 13:20, 12 July 2021
- {{Proth prime165 bytes (15 words) - 07:30, 26 July 2021
- {{Proth prime159 bytes (15 words) - 07:33, 26 July 2021
- {{Proth prime877 bytes (71 words) - 00:12, 30 April 2024
- {{Proth prime278 bytes (33 words) - 15:49, 11 July 2021
- {{Proth prime358 bytes (25 words) - 15:43, 11 July 2021
Page text matches
- ...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 prime432 bytes (32 words) - 13:38, 2 January 2023
- {{Proth prime498 bytes (31 words) - 13:34, 2 January 2023
- {{Proth prime334 bytes (32 words) - 15:12, 27 January 2023
- ...e covered, meaning that no member of the sequence {{Kbn|+|78557|n}} can be prime. The same arguments can be said of the numbers 271129, 271577, 322523, 3277 ...oices of {{Vk}}. However, sometimes {{Vn}} has to grow very large before a prime number appears.5 KB (650 words) - 10:25, 26 March 2024
- :28 [[Proth prime]]s for 3 ≤ {{Vk}} ≤ 97 :Found factor [[Proth prime 2 5|{{Kbn|+|5|2|39}}]] of {{DGF|36}}2 KB (195 words) - 00:13, 15 January 2024
- ...Sierpiński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 2 509203|{{Kbn|509203|n}}]] is always composite. *[[Riesel and Proth Prime Database]]827 bytes (112 words) - 08:21, 25 March 2024
- ...oth prime]]s and some others subjects like [[Aliquot sequence]]s or [[Home prime]]s. *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Database main page]380 bytes (59 words) - 14:14, 24 January 2019
- .... When the number is declared composite, the algorithm does not reveal the prime [[factor]]s. That is the job of the [[Factorization|factorization methods]] ...the confidence grows, but we cannot be completely sure that the number is prime until a primality test (which is far slower than a probable primality test3 KB (501 words) - 05:20, 3 August 2021
- ...ne number]]s<br/>a × b<sup>n</sup>±c (only factoring and [[probable prime|PRP]]-testing) | [https://github.com/danaj/Math-Prime-Util-GMP]2 KB (314 words) - 21:23, 29 August 2019
- ...: "The test that we today call Pépin's test is actually [[Proth's theorem|Proth's test]] with a proof provided by Lucas". Pépin's test says: If <math>n>0</math>, <math>F_n = 2^{2^n}+1</math> is a prime if and only if <math>\ 3^{(F_n-1)/2} \ \equiv -1 \ \pmod{F_n}</math>.2 KB (401 words) - 14:40, 6 March 2019
- **[[Proth's theorem|Proth algorithm]] for {{Kbn|+|k|n}} numbers. ...ith |{{V|c}}| ≠ 1 or {{V|k}} > {{Vb}}<sup>{{Vn}}</sup> can be [[probable prime|PRP]]-tested.2 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
- '''PrimeGrid''' is a [[distributed computing]] project for searching for [[prime]] numbers of world-record size. It makes use of the [[BOINC|Berkeley Open I *Type Proth:3 KB (458 words) - 10:28, 26 March 2024
- {{Proth prime581 bytes (64 words) - 19:18, 5 April 2023
- ...ng [[twin prime]]s of the same form) http://sites.google.com/site/kenscode/prime-programs *[[FermFact]] (performing sieving of Proth numbers) http://www.fermatsearch.org/FermFact-09b.zip2 KB (220 words) - 11:42, 7 March 2019
- This article is about '''Proth's theorem'''. Proth's theorem (1878) states:549 bytes (88 words) - 18:15, 28 September 2023
- ...in the form {{Kbn|+|k|n}} with 2<sup>''n''</sup> > ''k'' are often called Proth primes. *[[Proth's theorem]]656 bytes (91 words) - 07:02, 31 August 2020
- 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 *IDs and found dates from the [[The Prime Pages]]2 KB (279 words) - 03:48, 24 April 2024
- In [[number theory]], a '''Proth number''' is a number of the form ...that 2<sup>{{Vn}}</sup> > {{Vk}}, all odd integers greater than 1 would be Proth numbers, but most pages lists them, too.670 bytes (104 words) - 10:59, 9 July 2021
- ...e validity of [[Proth prime|Proth]] tests and PRP tests on base-2 [[Riesel prime]] candidates, and by those programs and [[PRST]] in an extended version for ...the original formulation of the Gerbicz error check for [[Proth's theorem|Proth tests]], as described in [https://www.mersenneforum.org/showthread.php?t=223 KB (528 words) - 14:59, 3 October 2023
- The first goal is, to spend as little CPU time as possible, per [[titanic prime]] found. The second goal is, to find a [[prime]] in a secure manner, worthy of an [[EFF prizes|E.F.F. prize]].3 KB (517 words) - 14:51, 15 February 2019
- {{Williams prime |WiMaxn={{GP|Proth prime 2 1|PMaxn}}243 bytes (35 words) - 08:06, 1 August 2021
- {{Williams prime |WiMaxn={{GP|Proth prime 2 3|PMaxn}}259 bytes (36 words) - 10:52, 13 July 2021
- {{Proth prime212 bytes (30 words) - 15:35, 2 October 2022
- {{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 prime1 KB (144 words) - 11:12, 24 August 2021
- {{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
- Automatically generated table from available [[:Category:Proth prime|Proth primes]]. category=Category:Proth 2750 bytes (108 words) - 14:39, 12 July 2021
- {{Proth prime {{HistC|2024-04-30|5000000|PrimeGrid Proth Prime Search}}3 KB (456 words) - 04:11, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}2 KB (248 words) - 08:42, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}2 KB (197 words) - 08:36, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}3 KB (412 words) - 08:00, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}1 KB (149 words) - 04:18, 15 May 2024
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}1 KB (153 words) - 04:17, 15 May 2024
- {{Proth prime371 bytes (31 words) - 08:06, 18 September 2021
- {{Proth prime {{HistC|2024-04-30|5000000|PrimeGrid Proth Prime Search}}1 KB (129 words) - 09:06, 14 May 2024
- {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 2 3|PMaxn|2}}258 bytes (36 words) - 08:07, 1 August 2021
- {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 5 4|PMaxn|1}}260 bytes (36 words) - 08:29, 11 February 2023
- {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 6 5|PMaxn|1}}260 bytes (36 words) - 16:08, 10 February 2023
- {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 2 7|PMaxn|3}}284 bytes (41 words) - 08:16, 1 August 2021
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 3 8|PMaxn}}/2)}}387 bytes (53 words) - 08:30, 12 July 2021
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 15|PMaxn}}/4)}}267 bytes (37 words) - 08:22, 1 August 2021
- {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 5 24|PMaxn|2}}358 bytes (45 words) - 08:28, 1 August 2021
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 3 26|PMaxn}}/3)}}443 bytes (56 words) - 08:44, 12 July 2021
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}913 bytes (102 words) - 03:04, 15 May 2024
- {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 2 31|PMaxn|5}}263 bytes (36 words) - 08:31, 1 August 2021
- {{Proth prime {{HistC|2024-02-29|4500000|PrimeGrid Proth Prime Search}}470 bytes (49 words) - 09:13, 14 May 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 511|PMaxn}}/9)}}272 bytes (37 words) - 09:15, 1 August 2021
- {{Williams prime |WiMaxn={{GP|Proth prime 3 4|PMaxn}}293 bytes (41 words) - 11:57, 13 July 2021
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 9|PMaxn}}/3)}}278 bytes (38 words) - 11:59, 13 July 2021
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 3 10|PMaxn}}/2)}}268 bytes (37 words) - 08:34, 12 July 2021
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}2 KB (210 words) - 02:44, 15 May 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 33|PMaxn}}/5)}}377 bytes (47 words) - 11:53, 13 July 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 (795 words) - 08:03, 5 May 2024
- {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 6 35|PMaxn|2}}356 bytes (45 words) - 08:33, 1 August 2021
- {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 7 48|PMaxn|2}}356 bytes (45 words) - 08:40, 1 August 2021
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}3 KB (299 words) - 01:29, 15 May 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 63|PMaxn}}/6)}}267 bytes (37 words) - 08:43, 1 August 2021
- |title=Proth '''Proth.exe''' is an ancient program that implements [[Proth's theorem]]. It is used to test the primality of the following forms:667 bytes (101 words) - 16:44, 31 August 2021
- {{Proth prime {{HistC|2019-07|3322000-3640000|PrimeGrid Proth Mega Prime Search}}1 KB (111 words) - 00:53, 15 May 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 127|PMaxn}}/7)}}272 bytes (37 words) - 08:49, 1 August 2021
- {{Proth prime {{HistF|2022-11-24|3824348|James Scott Brown,PrimeGrid Proth Prime Search}}3 KB (263 words) - 10:10, 14 May 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 255|PMaxn}}/8)}}272 bytes (37 words) - 08:51, 1 August 2021
- {{Proth prime {{HistC|2022-07-31|3322000|PrimeGrid Proth Prime Search}}3 KB (315 words) - 09:37, 14 May 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 1023|PMaxn}}/10)}}279 bytes (37 words) - 09:20, 1 August 2021
- {{Proth prime {{HistF|2022-03-24|3218214|Florian Baur,PrimeGrid Proth Prime Search}}2 KB (194 words) - 00:52, 15 May 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 129|PMaxn}}/7)}}290 bytes (38 words) - 12:03, 13 July 2021
- {{Proth prime {{HistC|2024-02-29|4500000|PrimeGrid Proth Prime Search}}2 KB (186 words) - 04:31, 14 May 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 513|PMaxn}}/9)}}272 bytes (37 words) - 12:05, 13 July 2021
- {{Proth prime {{HistC|2022-07-31|3322000|PrimeGrid Proth Prime Search}}1 KB (116 words) - 09:29, 14 May 2024
- {{Proth prime1 KB (19 words) - 16:07, 11 July 2021
- {{Proth prime1 KB (19 words) - 16:09, 11 July 2021
- {{Proth prime1 KB (124 words) - 08:43, 12 July 2021
- {{Proth prime631 bytes (65 words) - 08:21, 12 July 2021
- {{Proth prime681 bytes (56 words) - 15:43, 11 July 2021
- {{Proth prime122 bytes (13 words) - 10:23, 12 July 2021
- {{Proth prime561 bytes (72 words) - 17:14, 13 August 2021
- {{Proth prime545 bytes (60 words) - 14:28, 7 April 2023
- {{Proth prime694 bytes (77 words) - 15:44, 11 July 2021
- {{Proth prime318 bytes (34 words) - 15:42, 11 July 2021
- |include={Proth prime}:Pk,{Proth prime}:Pk |secseparators=[[Proth prime 5 ,|,,]]2 KB (245 words) - 11:43, 5 September 2021
- {{Proth prime115 bytes (12 words) - 13:33, 12 July 2021
- {{Proth prime114 bytes (12 words) - 13:22, 12 July 2021
- {{Proth prime398 bytes (29 words) - 15:58, 11 July 2021
- {{Proth prime ...y part of [[Multi Reservation:25|Multi Reservation 25]]: [[PrimeGrid Proth Prime Search Extended]].1 KB (161 words) - 09:08, 10 May 2024
- {{Proth prime608 bytes (65 words) - 07:12, 3 February 2024
- ...ding primes of the required parity for all smaller {{Vk}}-values. The even Proth conjecture was proven in 2015, and CRUS is continuing the [[CRUS Liskovets- got an irregular contribution of odd and even exponents yielding a prime.2 KB (367 words) - 12:42, 9 May 2024
- ...]], which relate to the smallest [[Riesel prime|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes for {{Vn}}-values of a give ...roven by [[Yves Gallot]], who provided examples for all four cases (Riesel/Proth, even/odd). Gallot further conjectured that these four examples are the sma7 KB (957 words) - 22:40, 10 June 2023
- {{Proth prime555 bytes (60 words) - 07:11, 3 February 2024
- {{Proth prime ...to be the smallest odd {{Vk}} ≡ 0 mod 3 for which {{Kbn|+|k|n}} is never prime for an even {{Vn}}. See [[Liskovets-Gallot conjectures]].396 bytes (50 words) - 09:17, 10 May 2024
- {{Proth prime ...lue seems the smallest {{Vk}} ≡ 0 mod 3 for which {{Kbn|+|k|n}} is never prime for an odd {{Vn}}. See [[Liskovets-Gallot conjectures]].457 bytes (43 words) - 15:52, 11 July 2021
- {{Proth prime403 bytes (36 words) - 09:59, 12 July 2021
- {{Proth prime459 bytes (40 words) - 09:57, 12 July 2021
- {{Proth prime582 bytes (53 words) - 10:16, 12 July 2021
- {{Proth prime561 bytes (36 words) - 08:44, 23 July 2021
- {{Proth prime657 bytes (66 words) - 08:33, 12 July 2021
- {{Proth prime115 bytes (12 words) - 13:33, 12 July 2021
- {{Proth prime115 bytes (12 words) - 13:34, 12 July 2021
