| 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 9" on this wiki! See also the search results found.
Page title matches
- {{Proth prime |Pk=94 KB (540 words) - 01:04, 27 September 2024
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 prime |PCount=9334 bytes (32 words) - 15:12, 27 January 2023
- |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 ...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, 32775 KB (650 words) - 10:25, 26 March 2024
- ...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 (774 words) - 07:39, 27 May 2024
- {{Proth prime 18;T:GT;C:{{NCu|64|3}}, {{NWi|MP|4|9}}3 KB (441 words) - 20:27, 26 September 2024
- {{Proth prime 1320487;9;T:G1 KB (165 words) - 20:36, 26 September 2024
- {{Proth prime |Pk=94 KB (540 words) - 01:04, 27 September 2024
- {{Proth prime 9;T:G4 KB (517 words) - 17:17, 7 September 2024
- {{Williams prime |WiBase=9585 bytes (80 words) - 11:03, 20 September 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 511|PMaxn}}/9)}}319 bytes (42 words) - 22:11, 5 September 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 9|PMaxn}}/3)}}309 bytes (42 words) - 21:13, 5 September 2024
- {{Williams prime |WiBase=9287 bytes (40 words) - 06:26, 20 September 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'' ≤9 KB (863 words) - 11:32, 12 October 2024
- {{Proth prime 9;T:G3 KB (362 words) - 15:31, 27 September 2024
- {{Proth prime 72;C:{{NWi|MP|256|9}}3 KB (297 words) - 19:42, 7 September 2024
- {{Proth prime 93 KB (354 words) - 20:15, 7 September 2024
- {{Proth prime 9;C:{{NWi|PP|512|1}}2 KB (228 words) - 20:02, 7 September 2024
- {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 513|PMaxn}}/9)}}319 bytes (42 words) - 22:12, 5 September 2024
- {{Proth prime 2;T:T;C:{{NWi|MP|9|1}}1 KB (167 words) - 21:06, 27 September 2024
- {{Proth prime |PMultiRes=9122 bytes (13 words) - 10:23, 12 July 2021
