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

Jump to: navigation, search

Page title matches

Page text matches

  • ...ath>\sum_{i=1}^\infty \frac{1}{p_i} = \frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + \frac{1}{11} + \dotsb = \infty</math></pre> :<math>\sum_{i=1}^\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
  • :{{V|F}}<sub>1</sub> = {{Kbn|+|2}} = 5 :{{V|F}}<sub>5</sub> = {{Kbn|+|32}} = 4294967297 = 641 &times; 6700417
    12 KB (1,913 words) - 14:35, 9 August 2021
  • *{{Kbn|+|78557|4n+1}} is multiple of 5. (those values form a [[covering set]] of {3, 5, 7, 13, 19, 37, 73}) we can prepare the following table for the exponents m
    5 KB (650 words) - 10:25, 26 March 2024
  • :28 [[Proth prime]]s for 3 &le; {{Vk}} &le; 97 :Found factor [[Proth prime 2 5|{{Kbn|+|5|2|39}}]] of {{DGF|36}}
    2 KB (195 words) - 00:13, 15 January 2024
  • ...: "The test that we today call Pépin's test is actually [[Proth's theorem|Proth's test]] with a proof provided by Lucas". ...ralized Fermat number]]s <math>F_{n,2} = 4^{3^n}+2^{3^n}+1</math> with k = 5 instead of k = 3.
    2 KB (401 words) - 14:40, 6 March 2019
  • ...^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 equal to 0. #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
  • '''PrimeGrid''' is a [[distributed computing]] project for searching for [[prime]] numbers of world-record size. It makes use of the [[BOINC|Berkeley Open I *Type Proth:
    3 KB (458 words) - 10:28, 26 March 2024
  • {{Proth prime |PCount=5
    212 bytes (30 words) - 15:35, 2 October 2022
  • {{Proth prime 5;T:G
    3 KB (336 words) - 16:58, 15 April 2024
  • {{Proth prime |Pk=5
    1 KB (144 words) - 11:12, 24 August 2021
  • {{Proth prime 5;T:G
    2 KB (240 words) - 08:58, 11 January 2023
  • {{Williams prime |WiBase=5
    260 bytes (36 words) - 08:29, 11 February 2023
  • {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 6 5|PMaxn|1}}
    260 bytes (36 words) - 16:08, 10 February 2023
  • {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 5 24|PMaxn|2}}
    358 bytes (45 words) - 08:28, 1 August 2021
  • {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 2 31|PMaxn|5}}
    263 bytes (36 words) - 08:31, 1 August 2021
  • {{Williams prime |WiMaxn={{#expr:floor({{GP|Proth prime 2 33|PMaxn}}/5)}}
    377 bytes (47 words) - 11:53, 13 July 2021
  • {{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 5
    2 KB (279 words) - 19:01, 9 April 2023
  • {{Proth prime 5
    2 KB (245 words) - 10:36, 12 September 2021
  • {{Proth prime 5;T:T
    2 KB (186 words) - 18:58, 9 April 2023

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