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 1" on this wiki! See also the search results found.
- {{Proth prime 1459 bytes (40 words) - 09:57, 12 July 2021
- {{Proth prime 1582 bytes (53 words) - 10:16, 12 July 2021
- {{Proth prime 1;T:T657 bytes (66 words) - 08:33, 12 July 2021
- To solve the [[Sierpiński problem]] by finding a prime of the form {{Kbn|+|k|n}} for each remaining value of {{Vk}} < 78,557. |debug=11 KB (135 words) - 11:42, 5 September 2021
- {{Proth prime |PCount=1314 bytes (35 words) - 08:43, 10 April 2023
- {{Proth prime |PCount=1310 bytes (35 words) - 08:44, 10 April 2023
- {{Proth prime |PCount=1225 bytes (24 words) - 15:53, 11 July 2021
- The goal of this project is to find [[Cullen prime 2|Cullen prime]]s of the form {{Kbn|+|n|2|n}}. *2009-07-25: [[Proth prime 6679881|{{Kbn|+|6679881|2|6679881}}]] ([http://primes.utm.edu/primes/page.p753 bytes (97 words) - 08:45, 12 September 2021
- {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 3 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 3.1 KB (156 words) - 09:18, 23 July 2021
- {{Proth prime |PCount=11 KB (129 words) - 18:02, 6 April 2023
- {{Proth prime |PCount=1209 bytes (22 words) - 23:39, 28 May 2024
- {{Proth prime |PCount=1871 bytes (98 words) - 12:55, 8 April 2023
- {{Proth prime |PCount=1209 bytes (22 words) - 23:40, 28 May 2024
- {{Proth prime |PCount=1859 bytes (98 words) - 13:02, 8 April 2023
- {{Proth prime 1558 bytes (46 words) - 09:40, 12 July 2021
- {{Proth prime 1642 bytes (53 words) - 09:32, 12 July 2021
- {{Proth prime 1;C:Divides Phi(3^1,2)2 KB (204 words) - 11:06, 18 April 2023
- {{Proth prime 1313 bytes (27 words) - 09:51, 12 July 2021
- {{Proth prime 1391 bytes (32 words) - 10:04, 12 July 2021
- {{Proth prime 1339 bytes (28 words) - 09:31, 12 July 2021