Search results

Create the page "Proth prime 9" on this wiki! See also the search results found.

Page title matches

• Proth prime 2 9
  {{Proth prime |Pk=9
  3 KB (432 words) - 18:48, 9 April 2023

Page text matches

• Examples
  ...de=true|title=Example of prime sequence and reservation|content=[[Williams prime MM 5]]}} *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Databse RPPDb]
  11 KB (1,236 words) - 14:41, 3 September 2020
• Fermat number
  ...ese factorisations can be found at [http://www.prothsearch.com/fermat.html Prime Factors of Fermat Numbers] ...</sup> + 1 &equiv; 0 (mod 2^{{V|a}} + 1).) In other words, every prime of the form {{Kbn|+|n}} is a Fermat number, and such primes are called '''F
  12 KB (1,913 words) - 14:35, 9 August 2021
• Proth prime 2 1943873
  {{Proth prime |PCount=9
  334 bytes (32 words) - 15:12, 27 January 2023
• Sierpiński problem
  |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, 3277
  5 KB (650 words) - 10:25, 26 March 2024
• Generalized Fermat number
  ...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
• Proth prime 2 5
  {{Proth prime 1320487;9;T:G
  1 KB (144 words) - 11:12, 24 August 2021
• Proth prime 2 9
  {{Proth prime |Pk=9
  3 KB (432 words) - 18:48, 9 April 2023
• Proth prime 2 15
  {{Proth prime 9;T:G
  3 KB (390 words) - 10:00, 25 August 2021
• Williams prime MP 9
  {{Williams prime |WiBase=9
  387 bytes (53 words) - 08:30, 12 July 2021
• Williams prime MP 512
  {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 511|PMaxn}}/9)}}
  272 bytes (37 words) - 09:15, 1 August 2021
• Williams prime PP 8
  {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 9|PMaxn}}/3)}}
  278 bytes (38 words) - 11:59, 13 July 2021
• Williams prime PP 9
  {{Williams prime |WiBase=9
  268 bytes (37 words) - 08:34, 12 July 2021
• Proth prime small bases least n
  {{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
• Proth prime 2 63
  {{Proth prime 9;T:G
  2 KB (279 words) - 19:01, 9 April 2023
• Proth prime 2 1023
  {{Proth prime 9
  3 KB (289 words) - 10:52, 21 September 2021
• Proth prime 2 513
  {{Proth prime 9
  2 KB (177 words) - 09:40, 7 September 2021
• Williams prime PP 512
  {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 513|PMaxn}}/9)}}
  272 bytes (37 words) - 12:05, 13 July 2021
• Proth prime 3 8
  {{Proth prime |PRemarks=See also {{NWi|MP|9|n}}<br>The {{OEIS|l|A005538}}
  631 bytes (65 words) - 08:21, 12 July 2021
• Proth prime 5 6436
  {{Proth prime |PMultiRes=9
  122 bytes (13 words) - 10:23, 12 July 2021
• Proth prime 2 68633
  {{Proth prime 9
  545 bytes (60 words) - 14:28, 7 April 2023

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)