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
  • ...= {{Kbn|4}}, for example, is not a prime, because 15 is divisible by 3 and 5. ...ion; in the 4th century BC [[Euclid]] demonstrated that if M is a Mersenne prime then M(M+1)/2 is a perfect number. Two millennia later, in the 18th century
    5 KB (857 words) - 14:53, 19 September 2021
  • {{Riesel prime 5
    935 bytes (70 words) - 18:56, 10 December 2022
  • {{Riesel prime 5
    557 bytes (25 words) - 12:35, 11 December 2022
  • ...up to support [[GIMPS]], the broader community of [[Mersenne number]]s, [[prime]] number, and factoring projects. In addition to being the de facto help an ==Prime number software discussion and development==
    2 KB (293 words) - 17:33, 5 July 2019
  • *{{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
  • ...^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 :[[PrimeGrid 321 Prime Search|321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}.
    3 KB (458 words) - 10:28, 26 March 2024
  • ..., 23 is a Sophie Germain prime because it is a prime and 2*23+1 = 47, also prime. | 3 || 5 || {{NRi|3|1}}
    1 KB (171 words) - 04:26, 3 November 2020
  • ...application using [[LLR]], [[PFGW]], [[phrot]], and [[genefer]] to find [[prime]]s. *[[Sierpiński-Riesel Base 5]]
    531 bytes (63 words) - 13:36, 5 November 2023
  • {{DISPLAYTITLE:Riesel problem, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}}} The '''Riesel problem''' involves determining the smallest [[Riesel number]].
    6 KB (689 words) - 18:14, 4 April 2024
  • '''Tutorial to LLR (Lucas Lehmer Riesel) and PRP:''' ...t same way as LLR''' except that it only finds numbers that are [[probable prime]]s.
    2 KB (337 words) - 13:24, 20 February 2019
  • {{Riesel prime 5;C:'''[[M3]]''', {{NWo|+|3}}, {{NWo|4|2}}, {{NWo|32|1}}
    2 KB (288 words) - 11:41, 3 April 2023
  • {{Riesel prime 6;T:ST;C:{{NWo|+|5}}, {{NWi|MM|4|3}}
    5 KB (523 words) - 09:47, 5 October 2023
  • {{Riesel prime |Rk=5
    2 KB (196 words) - 18:36, 9 October 2021
  • {{Riesel prime 5
    3 KB (264 words) - 22:08, 5 July 2023
  • {{Riesel prime |RReserved=Riesel Prime Search
    2 KB (214 words) - 23:02, 22 November 2021
  • {{Riesel prime 5;T:S
    3 KB (329 words) - 07:59, 17 August 2021
  • {{Riesel prime 5;T:S
    2 KB (181 words) - 08:04, 17 August 2021
  • {{Riesel prime 5
    2 KB (228 words) - 19:30, 19 July 2023

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