Search results

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

Page title matches

• Proth prime 2 7
  {{Proth prime |Pk=7
  2 KB (267 words) - 21:47, 5 July 2023
• Proth prime 7 48
  {{Proth prime |Pb=7
  403 bytes (36 words) - 09:59, 12 July 2021
• Proth prime 7 4
  {{Proth prime |Pb=7
  459 bytes (40 words) - 09:57, 12 July 2021

Page text matches

• Examples
  ...^\infty \frac{1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math></pre> ...^\infty \frac{1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math>
  11 KB (1,236 words) - 14:41, 3 September 2020
• Fermat number
  :{{V|F}}₇ = {{Kbn|+|128}} = 340282366920938463463374607431768211457 = 596495891 ...ese factorisations can be found at [http://www.prothsearch.com/fermat.html Prime Factors of Fermat Numbers]
  12 KB (1,913 words) - 14:35, 9 August 2021
• Sierpiński problem
  *{{Kbn|+|78557|3n+1}} is multiple of 7. (those values form a [[covering set]] of {3, 5, 7, 13, 19, 37, 73}) we can prepare the following table for the exponents modu
  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
• Riesel prime
  Although there's no official definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2^{{Vn}} > {{Vk ...2 #1 (2016-02-11)] - [https://www.mersenneforum.org/showpost.php?p=541048 #7 (2020-03-27)]
  2 KB (279 words) - 03:48, 24 April 2024
• Proth prime 2 5
  {{Proth prime 7;T:G
  1 KB (144 words) - 11:12, 24 August 2021
• Proth prime 2 7
  {{Proth prime |Pk=7
  2 KB (267 words) - 21:47, 5 July 2023
• Proth prime 2 9
  {{Proth prime 7;T:GT
  3 KB (432 words) - 18:48, 9 April 2023
• Proth prime 2 11
  {{Proth prime 7;T:G
  2 KB (240 words) - 08:58, 11 January 2023
• Williams prime MP 8
  {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 2 7|PMaxn|3}}
  284 bytes (41 words) - 08:16, 1 August 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
• Williams prime MP 49
  {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 7 48|PMaxn|2}}
  356 bytes (45 words) - 08:40, 1 August 2021
• Williams prime MP 128
  {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 127|PMaxn}}/7)}}
  272 bytes (37 words) - 08:49, 1 August 2021
• Williams prime PP 128
  {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 129|PMaxn}}/7)}}
  290 bytes (38 words) - 12:03, 13 July 2021
• Proth prime 3 8
  {{Proth prime 7
  631 bytes (65 words) - 08:21, 12 July 2021
• Proth prime 7 48
  {{Proth prime |Pb=7
  403 bytes (36 words) - 09:59, 12 July 2021
• Proth prime 7 4
  {{Proth prime |Pb=7
  459 bytes (40 words) - 09:57, 12 July 2021
• Statistics
  ...mber || style="text-align:right;"|{{Num|{{#expr:{{PAGESINCATEGORY:Mersenne prime|pages|R}}-2}}}} ...| base || style="text-align:right;"|{{Num|{{#expr:{{PAGESINCATEGORY:Riesel prime|subcats|R}}-3}}}}
  11 KB (1,385 words) - 17:23, 5 April 2024
• Proth prime 3 10
  {{Proth prime 7
  657 bytes (66 words) - 08:33, 12 July 2021
• PrimeGrid Prime Sierpiński Problem
  ...a continuation of the [https://www.mersenneforum.org/showthread.php?t=2665 Prime Sierpinski Project] that operated on the Mersenne Forums. ...= 78557 is the smallest Sierpiński number. However, 78557 itself is not a prime number.
  2 KB (254 words) - 11:43, 5 September 2021

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