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
  • *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Databse RPPDb] The <b>[[:Category:Carol-Kynea_prime|category]]</b> for Carol/Kynea primes holds example pages for some bases.
    11 KB (1,236 words) - 14:41, 3 September 2020
  • ...enerally, [[Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are one less than a power of two; hence, ...l to the sum of their proper divisors. Historically, the study of Mersenne primes was motivated by this connection; in the 4th century BC [[Euclid]] demonstr
    5 KB (857 words) - 14:53, 19 September 2021
  • *[[Riesel Prime Search]] *[[Sierpiński-Riesel Base 5]]
    2 KB (293 words) - 17:33, 5 July 2019
  • ...rime]] searching project started on 2008-01-10. The project searches for [[Riesel prime]]s of the form {{Kbn|k|2|n}} with odd {{Vk}} and 300 < {{Vk}} < 1001 *[https://primes.utm.edu/bios/page.php?id=518 Project at The Prime Pages]
    752 bytes (111 words) - 11:31, 5 October 2020
  • In early 2002, primes had been found for all but seventeen choices of {{Vk}}. At that point, the *[[Riesel problem 1|Riesel problem]]
    5 KB (650 words) - 10:25, 26 March 2024
  • The '''Riesel and Proth Prime Database''' is a database mainly of [[Riesel prime]]s and [[Proth prime]]s and some others subjects like [[Aliquot seque *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Database main page]
    380 bytes (59 words) - 14:14, 24 January 2019
  • *[[LLR|Lucas–Lehmer–Riesel test]]: Used for [[Riesel prime]]s.
    3 KB (501 words) - 05:20, 3 August 2021
  • In 1985, Dubner for the first time built a list of large primes of the form: b<sup>2<sup>m</sup></sup>+1, ''b &ge; 2'' and ''m &ge; 1''. ==Björn & Riesel==
    5 KB (726 words) - 09:57, 12 September 2021
  • :[[PrimeGrid 321 Prime Search|321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}. :[[PrimeGrid 27121 Prime Search|27121 Prime Search]] searching for primes of the forms {{Kbn|±|27|2|n}} and {{Kbn|±|121|2|n}}.
    3 KB (458 words) - 10:28, 26 March 2024
  • ...ted computing project that looks for large [[twin prime]]s ([[Riesel prime|Riesel type]] {{Kbn|k|n}}) of world record size.
    826 bytes (100 words) - 11:04, 21 March 2024
  • '''Riesel Prime Search''' (RPS) is a prime searching project established in 2005 by [ :The project is searching for [[Riesel prime]]s {{Kbn|k|n}}, {{Vk}} > 1.
    852 bytes (120 words) - 20:24, 7 March 2024
  • It is not known whether there are infinitely many Sophie Germain primes. ==List of Sophie Germain primes==
    1 KB (171 words) - 04:26, 3 November 2020
  • | discoverer=[[Hans Riesel]] ...[Mersenne prime]] 2<sup>{{Num|3217}}</sup>-1 found on 1957-09-08 by [[Hans Riesel]].
    415 bytes (47 words) - 22:26, 17 February 2019
  • Although there's no official definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk}} are called like th *[https://www.mersenneforum.org/showthread.php?t=13180 "Post Top-5000 Primes Here"]: [https://www.mersenneforum.org/showpost.php?p=208696 #1 (2010-03-17
    2 KB (279 words) - 03:48, 24 April 2024
  • The '''Riesel sieve project (RSP)''' is a [[distributed computing]] project. It is now a ...e to find primes for all the remaining k values to prove that they are not Riesel numbers.
    2 KB (326 words) - 10:29, 26 March 2024
  • Several [[distributed computing]] projects use PRPclient to find primes, including: *[[Sierpiński-Riesel Base 5]]
    531 bytes (63 words) - 13:36, 5 November 2023
  • The '''Sierpiński-Riesel Base 5 Project''' is a [[distributed computing project]]. It was formerly m ...e smallest possible [[Riesel number base 5]]. To prove this, one must find primes for all {{Vk}} below the smallest known number.
    2 KB (231 words) - 11:42, 5 October 2020
  • {{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:''' The projects [[Prime Sierpiński Project]] and [[Riesel Sieve]] also use [[LLRNET]], which is recommended for people with a perman
    2 KB (337 words) - 13:24, 20 February 2019
  • {{Riesel prime *[[List of known Mersenne primes]]
    2 KB (288 words) - 11:41, 3 April 2023

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