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 k=1-300" on this wiki! See also the search results found.
- ==k-values left== |include={Proth prime}:Pk,{Proth prime}:Pk2 KB (245 words) - 11:43, 5 September 2021
- ...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- [[Valery Liskovets]] studied the list of {{Kbn|+|k|n}} primes and observed, that the {{Vk}}'s ({{Vk}} divisible by 3)2 KB (367 words) - 12:42, 9 May 2024
- ...ris Nash]] gave a weight to show the number of remaining values of {{Kbn|+|k|n}} after sieving the range 100000 < {{Vn}} < 110000 after performing a Nas A later definition was also done for {{Kbn|k|n}}.2 KB (330 words) - 09:11, 23 September 2021
- | [[:Category:Riesel 2|Riesel primes {{Kbn|k|2|n}}]] || {{Vk}}-value || style="text-align:right;"|{{Num|{{PAGESINCATEGOR | [[:Category:Riesel prime|Riesel primes {{Kbn|k|b|n}}]], {{Vb}}>2 || base || style="text-align:right;"|{{Num|{{#expr:{{P11 KB (1,385 words) - 17:23, 5 April 2024
- To solve the [[Sierpiński problem]] by finding a prime of the form {{Kbn|+|k|n}} for each remaining value of {{Vk}} < 78,557. |include={Proth prime}:Pk,{Proth prime}:Pk1 KB (135 words) - 11:42, 5 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
- {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 15 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 15.1 KB (156 words) - 09:22, 23 July 2021
- {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 2145 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 2145.1 KB (156 words) - 09:36, 23 July 2021
- {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 2805 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 2805.1 KB (158 words) - 09:16, 22 March 2024
- {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}}, {{Vk}} < 300}} Automatically generated table from available [[:Category:Proth 2 1-300|Proth primes {{Vk}} < 300]].850 bytes (117 words) - 17:18, 25 July 2021
- {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with no prime value so far}} Proth numbers {{Kbn|+|k|n}} where no prime values are known.867 bytes (117 words) - 07:46, 26 July 2021
- {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with 100 and more primes}} Proth numbers {{Kbn|+|k|n}} with 100 or more prime values {{Vn}}.916 bytes (122 words) - 07:51, 26 July 2021
- {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}} with missing ranges}} Proth {{Vk}}-values with missing ranges below the largest known prime for that {{778 bytes (107 words) - 07:57, 26 July 2021
- Finding primes for the form {{Kbn|+|k|n}} for 100 < {{Vk}} < 1200 to {{Vn}}=3322000. [[Category:PrimeGrid Proth Prime Search| ]]468 bytes (59 words) - 07:11, 12 October 2021
- {{Proth prime {{HistF|2018-02-27|3487253|James Scott Brown,PrimeGrid Proth Mega Prime Search}}2 KB (157 words) - 09:38, 7 September 2021
- {{Proth prime {{HistF|2021-08-23|3078792|James Scott Brown,PrimeGrid Proth Prime Search}}4 KB (409 words) - 09:41, 7 September 2021
- {{Proth prime {{HistF|2021-05-02|3025527|Barry Schnur,PrimeGrid Proth Prime Search}}3 KB (248 words) - 11:22, 7 September 2021
- {{Proth prime ...rks=All primes are also [[Generalized Fermat number#Special conditions for Proth primes|Generalized Fermat primes]].1 KB (127 words) - 10:01, 21 September 2021
- {{Proth prime {{HistF|2021-07-10|3066009|Ryan Propper,PrimeGrid Proth Prime Search}}3 KB (304 words) - 19:58, 13 September 2021
- {{Proth prime {{HistF|2021-05-06|3029342|Stefan Larsson,PrimeGrid Proth Prime Search}}2 KB (223 words) - 07:20, 15 September 2021