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

Create the page "Primes" on this wiki! See also the search results found.

Page title matches

  • List of known Mersenne primes
    *'''#''': number count of the Mersenne primes linked to that prime page *[https://www.mersenne.org/primes/ List of known Mersenne prime numbers] at Mersenne.org
    2 KB (360 words) - 09:44, 6 March 2019
  • Seventeen or Bust/Primes
    *[https://primes.utm.edu/primes/search.php All SoB primes]
    2 KB (163 words) - 14:20, 7 March 2019

Page text matches

  • Williams prime
    Lists of primes for bases ''b'' and ''n''-values can be found here: ...e included as a separate page.</ref> !! Smallest <ref>The list of smallest primes of any base is an ASCII file for 2 ≤ ''b'' ≤ 1024. For unknown values o
    5 KB (744 words) - 07:30, 5 August 2019
  • Carol-Kynea prime 2
    ==History for Carol primes== ==History for Kynea primes==
    5 KB (537 words) - 08:17, 9 October 2020
  • Carol-Kynea table
    ...y generated table from available [[:Category:Carol-Kynea prime|Carol-Kynea primes]]. ==Primes table==
    936 bytes (125 words) - 11:11, 11 June 2019
  • Examples
    The <b>[[:Category:Carol-Kynea_prime|category]]</b> for Carol/Kynea primes holds example pages for some bases. * field: rieselk_id = 4 (-> "1" = Mersenne primes)
    11 KB (1,236 words) - 14:41, 3 September 2020
  • Great Internet Mersenne Prime Search
    Mersenne primes are named after [[Marin Mersenne]], a French monk and mathematician, who wa ...ring the largest Mersenne Primes to date. See the [[list of known Mersenne primes]] for more details.
    3 KB (450 words) - 14:37, 21 August 2019
  • List of known Mersenne primes
    *'''#''': number count of the Mersenne primes linked to that prime page *[https://www.mersenne.org/primes/ List of known Mersenne prime numbers] at Mersenne.org
    2 KB (360 words) - 09:44, 6 March 2019
  • Mersenne prime
    ...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
  • Leonhard Euler
    ...ant role in opening up new windows onto our understanding, not just of the primes, but in many other areas of mathematics as well.
    16 KB (2,614 words) - 11:48, 14 January 2024
  • Marin Mersenne
    ==Mersenne primes== In 1644 he conjectured that the only [[Mersenne prime|Mersenne primes]] less than or equal to M(257) were:<br>M(2), M(3), M(5), M(7), M(13), M(17
    11 KB (1,582 words) - 01:17, 15 January 2024
  • Chris Caldwell
    733 bytes (107 words) - 11:27, 14 January 2024
  • Landon Curt Noll
    *[http://primes.utm.edu/bios/includes/nollnote.php Entry at] [[The Prime Pages]]
    2 KB (333 words) - 12:40, 9 February 2022
  • David Slowinski
    ...that he wrote]]) and has been involved in the discovery of seven Mersenne primes, namely: *[http://primes.utm.edu/bios/page.php?lastname=Slowinski The Prime Pages - David Slowinski]
    1 KB (213 words) - 23:53, 14 January 2024
  • Fermat number
    ...ber, and such primes are called '''Fermat primes'''. The only known Fermat primes are {{V|F}}<sub>0</sub>,...,{{V|F}}<sub>4</sub>. ...he sequence {{{V|p}}<sub>{{Vn}}</sub>} is an infinite sequence of distinct primes.
    12 KB (1,913 words) - 14:35, 9 August 2021
  • Aaron Blosser
    He is listed as co-discoverer of [[M49]], [[M50]] and [[M51]] Mersenne primes.
    192 bytes (26 words) - 12:04, 21 August 2019
  • Derrick Henry Lehmer
    ...'' and the superposition of the corresponding stencils to reveal those few primes having these residues ''R''. ...Lehmer presented data to contradict this conjecture, especially for small primes, and [[Christopher Hooley]] later showed that this follows from the [[Gener
    6 KB (1,033 words) - 01:13, 15 January 2024
  • Megaprime
    ...y many natural numbers with less than {{Num|1000000}} digits, "nearly all" primes are megaprimes. ...e [[Mersenne prime]]s. The current list is avalable [http://primes.utm.edu/primes/search.php?MinDigits=1000000&&Number=10000&Style=HTML here].
    806 bytes (111 words) - 07:59, 14 July 2021
  • Gigaprime
    ...any natural numbers with less than {{Num|1000000000}} digits, "nearly all" primes are gigaprimes.
    871 bytes (119 words) - 07:54, 14 July 2021
  • Base 2 Home Prime Results
    ==Search for Home Primes base 2== ===Table of open Home Primes up to {{Vn}} = {{Num|12000}}===
    2 KB (175 words) - 18:45, 14 December 2023
  • Cunningham project
    ...rich prime, satisfying <math>2^{n-1} = 1\ (mod\ n^2)</math>. Only two such primes are known 1093 and 3511, out of a very deep search, and neither of these sq
    7 KB (1,150 words) - 23:48, 19 April 2023
  • 2 Minus Tables
    .... Given here links to [[Factoring Database]] in html and text formats. The primes are the [[Mersenne prime]]s. ==Primes for ''n''==
    2 KB (176 words) - 12:01, 13 February 2019
  • M25
    ...dates (31 of 75). There was a theory that there was an 'Island of Mersenne Primes'. They were testing this theory and that Tuckerman's discovery of [[M24]] ( *[http://primes.utm.edu/bios/includes/nollnote.php Noll at the Prime Pages]
    2 KB (303 words) - 11:01, 26 February 2019
  • Lucas-Lehmer test
    ...ent has order N-1 we must show that it does not have order (N-1)/q for all primes q dividing N-1. Thus, if we know all the factors of N-1, we can prove N pri ...1}\over 2}\omega^{{Q+1}\over 2}</math>. Again, 2 is a quadratic residue of primes congruent to <math>\pm 1</math> mod 8, and <math>Q</math> is of this form,
    20 KB (3,572 words) - 14:30, 17 February 2019
  • Factoring Database
    **Inverse home primes of various bases
    1 KB (144 words) - 13:44, 24 January 2019
  • Electronic Frontier Foundation
    ...to a special donation, EFF confers [[EFF prizes|prizes]] for finding huge primes. It is expected that these prizes will encourage collaborative computing.
    602 bytes (87 words) - 12:44, 29 January 2019
  • Mlucas
    The program was used to verify primes [[M38]], [[M45]], [[M46]], [[M47]], [[M48]], [[M49]], [[M50]] and [[M51]] a
    1 KB (198 words) - 07:28, 22 August 2019
  • Ernst Mayer
    2 KB (251 words) - 18:53, 14 December 2023
  • M47
    ...mainder being used by GIMPS to provide awards to other finders of Mersenne primes and to cover expenses. *[http://www.math.ucla.edu/~edson/prime/ Edson Smith and primes]
    5 KB (694 words) - 13:17, 21 August 2019
  • Prime95
    As of December 2018, Prime95 was used to discover all 17 Mersenne primes found by GIMPS. ==Finding Mersenne primes by distributed computing==
    11 KB (1,586 words) - 12:24, 7 August 2021
  • CUDALucas
    The program was used to verify primes [[M48]], [[M49]], [[M50]] and [[M51]] at the times of their discovery.
    2 KB (275 words) - 11:11, 21 August 2019
  • Glucas
    ...ersenne number]]s. It is related to [[GIMPS]] effort to search the largest primes ever found. It was written in C by Guillermo Ballester Valor and Klaus Kast Glucas was used to verify [[M41]], [[M43]], [[M46]] and [[M47]] primes at the times of their discovery.
    3 KB (426 words) - 14:21, 14 February 2019
  • Distributed computing
    4 KB (674 words) - 12:11, 19 February 2019
  • MersenneForum
    ...hers, MersenneForum is used by: <!-- discoverers and verifiers of Mersenne primes, as well as software developers -->
    2 KB (293 words) - 17:33, 5 July 2019
  • M34
    ...company or before they joined the company, discovered 10 of the 11 record primes between 1978 and 1996, namely Slowinski, Gage, and [[Landon Curt Noll]] (ei *[http://primes.utm.edu/notes/1257787.html The Prime Pages]
    3 KB (513 words) - 08:42, 18 February 2019
  • Paul Gage
    351 bytes (43 words) - 23:51, 14 January 2024
  • No Prime Left Behind
    745 bytes (111 words) - 02:17, 1 May 2024
  • 2 Plus Tables
    ...[[Factoring Database]] in html and text formats. The primes are the Fermat primes. ==Primes for ''n''==
    2 KB (127 words) - 15:28, 17 August 2019
  • Binary
    1 KB (210 words) - 11:16, 22 January 2019
  • Repunit
    1 KB (207 words) - 08:04, 12 March 2024
  • Mersennewiki
    647 bytes (99 words) - 12:09, 25 February 2019
  • Trial factoring
    ...arly for the case of a 32-bit digit size, though now there are 203,280,220 primes to test, and, each one requires 32 bits of storage rather than 16 bits... B ...e <math>2^{32} - 1</math>, would suffice for a sieving process to generate primes as candidate factors up to <math>2^{64}</math> that would suffice to test N
    7 KB (1,221 words) - 13:20, 11 February 2019
  • Steven Boone
    512 bytes (71 words) - 11:26, 14 January 2024
  • M45
    ...ww.mersenne.org/primes/m45and46.htm GIMPS Discovers 45th and 46th Mersenne Primes] (press release) *[https://www.mersenne.org/primes/Known Mersenne primes] at [[GIMPS]]
    2 KB (251 words) - 11:40, 18 February 2019
  • Coprime
    Two [[integer]] numbers are '''coprime''' or relatively primes when their [[greatest common divisor]] is 1 (<math>\gcd{(x,y)} = 1</math>).
    738 bytes (112 words) - 09:50, 23 January 2019
  • M35
    ...program]] useful in both in testing PC's and that it could indeed find new primes.
    2 KB (224 words) - 11:00, 18 February 2019
  • University of California, Los Angeles
    Prior to the Internet, 7 Mersenne primes were discovered at UCLA ...were the first ever to be found using a [[computer]]. Robinson's Mersenne primes were the first to be found in 75 years (2 in the very first day of the run,
    2 KB (347 words) - 14:54, 19 September 2021
  • Raphael M. Robinson
    4 KB (526 words) - 14:51, 19 September 2021
  • M36
    ...puter|supercomputer]] by [[David Slowinski]], discoverer of seven Mersenne primes between 1979 and 1996.
    2 KB (279 words) - 11:01, 18 February 2019
  • Jonathan Pace
    ...years prior to the discovery. He first became interested in searching for primes in 2003, when he read an article about the discovery of the [[M40|40th know *[https://www.mersenne.org/primes/press/M77232917.html 50th Known Mersenne Prime Discovered] (press release)
    2 KB (242 words) - 00:08, 15 January 2024
  • Sierpiński problem
    In early 2002, primes had been found for all but seventeen choices of {{Vk}}. At that point, the
    5 KB (650 words) - 10:25, 26 March 2024
  • Paul Seelhoff
    :[https://primes.utm.edu/curios/page.php?curio_id=11327 Prime Curios!] of [[The Prime Pages]
    2 KB (195 words) - 00:13, 15 January 2024
  • Seventeen or Bust
    ...are the largest prime that are not a [[Mersenne prime]]. Six of the eleven primes rest in the Top 100. *[http://www.utm.edu/research/primes/index.html Chris Caldwell's Prime Pages and top rank lists]
    3 KB (544 words) - 16:44, 21 July 2019
  • Perfect number
    ...ese assumptions was that since 2, 3, 5, and 7 are precisely the first four primes, the fifth perfect number would be obtained when ''n'' = 11, the fifth prim ...concrete one-to-one association between even perfect numbers and Mersenne primes. This result is often referred to as the "Euclid-Euler Theorem."
    6 KB (885 words) - 11:33, 7 March 2019
  • M9
    ...ed so until 1911. Prior to the developement of the Lucas test all Mersenne primes were proved by some form of [[trial factoring]]. Pervushin used the [[Lucas *[http://primes.utm.edu/curios/page.php/2305843009213693951.html Prime curios: 230584300921
    2 KB (213 words) - 14:30, 17 February 2019
  • GIMPS clients
    ...ested for primality ("is it a prime?") faster than other sorts of would-be primes of the same magnitude. "Faster" here is still measured in weeks, but that c
    8 KB (1,218 words) - 15:37, 13 August 2020
  • Mfakto
    ...or candidates (FCs) are pre-sieved on the CPU. The first <SievePrimes> odd primes are used to sieve the FCs. (relevant for CPU sieving only) ...far we sieve the factor candidates on the GPU. The first <GPUSievePrimes> primes are sieved. This parameter also influences the shared mem requirements (low
    17 KB (2,524 words) - 12:39, 24 January 2019
  • Riesel and Proth Prime Database
    380 bytes (59 words) - 14:14, 24 January 2019
  • Primality test
    3 KB (501 words) - 05:20, 3 August 2021
  • Mprime (Cray)
    639 bytes (92 words) - 12:02, 7 February 2019
  • Probable prime
    ...ble primes have different specific conditions. While there may be probable primes that are [[Composite number|composite]] (called [[pseudoprime]]s), the cond
    2 KB (232 words) - 07:28, 12 March 2024
  • Pseudoprime
    ...in the RSA encryption system, where each party needs to generate two large primes, possibly with hundreds of decimal digits. Actually testing candidates for
    1 KB (155 words) - 20:32, 25 July 2020
  • GIMPS factoring and sieving
    ...mber]]s with prime exponents are eliminated from consideration as possible primes this way, so factoring is an important component of maximizing the work thr
    6 KB (962 words) - 10:08, 7 March 2019
  • Quadratic residue
    823 bytes (117 words) - 20:11, 26 October 2020
  • Ten million digits
    979 bytes (146 words) - 14:23, 6 March 2019
  • PSearch
    *[http://primes.utm.edu/bios/page.php?id=437 The Prime Pages Titan Biography]
    1 KB (182 words) - 08:17, 12 July 2020
  • Brent-Suyama extension
    Slicker would be to note that all primes > 3 are of form 6k+/-1. Suppose instead that we compute T=S<sup>(6k)<sup>2< ...that it is a [[primorial]]. A larger primorial increases the proportion of primes that pair up, at the cost of having to consider a larger number of congruen
    2 KB (421 words) - 11:51, 28 January 2019
  • Self-initializing quadratic sieve
    .../math> where u is the product of small [[prime]] numbers. The set of these primes is the ''factor base''. These relations will be found using [[sieving]] as ...th> modulo any prime of the factor base. This means that about half of the primes cannot be in the factor base because <math>N</math> cannot be a [[quadratic
    10 KB (1,763 words) - 02:56, 12 March 2019
  • GeneferCUDA
    362 bytes (48 words) - 09:20, 29 January 2019
  • Generalized Fermat prime
    ...&OnList=yes&Number=10&Style=HTML Current Top10] largest generalized Fermat primes at Prime Pages
    372 bytes (49 words) - 13:35, 6 March 2019
  • Generalized Fermat number
    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''. ...p.'' 67 (1998), pp. 441-446</ref> for the first time built a list of large primes of the form: a<sup>2<sup>m</sup></sup>+b<sup>2<sup>m</sup></sup>, ''b > a &
    5 KB (726 words) - 09:57, 12 September 2021
  • PrimeGrid
    :[[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
  • Worktype
    ...ain goals of GIMPS (finding [[Mersenne prime]]s, ensuring that no Mersenne primes have been missed, and lastly finding [[factor]]s for [[Mersenne number]]s).
    4 KB (603 words) - 02:31, 18 August 2019
  • PrimeNet server
    ...re forced into service has had important benefits. Since one of the 2 new primes was 10 million decimal digits long, it qualified for one of the [[EFF prize
    2 KB (381 words) - 14:05, 21 August 2019
  • 100 Million Digit Prefactor Project
    ...nne prime]] was discovered, interest in working on '''100''' million digit primes picked up sharply. This coupled with new versions of Prime95 and PrimeNet,
    3 KB (534 words) - 10:06, 7 March 2019
  • 321 Search
    These are the simple steps needed to participate in the 321 Search for primes. Test your range for primes by using [[LLR]].
    1 KB (185 words) - 09:34, 3 August 2021
  • Sieve of Eratosthenes
    There are approximately <math>\sqrt{N}\over{log\sqrt{N}}</math> primes smaller than <math>\sqrt{N}</math>, and for each one we do <math>N</math> t The sieve of Eratosthenes is generally used to generate a list of primes for computation of some sort. For example, one may use it to rapidly genera
    4 KB (654 words) - 11:10, 6 February 2019
  • Amazon EC2
    Amazon EC2 instances were used to verify record-breaking primes [[M49]] and [[M50]] at the time of their discovery.
    1 KB (155 words) - 11:48, 12 February 2019
  • Prime
    ...dea of a 'largest prime' is fiction. And, if there is no largest prime the primes must be infinite. ...rs must end with either 1 more or 5 more than these digits. Therefore, all primes greater than 2 will end with a 1, 3, 5, 7, or 9, and, since any number endi
    2 KB (447 words) - 00:22, 10 July 2023
  • Twin prime
    ...y twin primes. But it is known that the sum of the reciprocals of all twin primes converges to Brun's constant (about 1.902160583104). ==List of twin primes==
    2 KB (255 words) - 06:08, 21 February 2023
  • Twin Prime Search
    826 bytes (100 words) - 11:04, 21 March 2024
  • Riesel Prime Search
    :# {{Vk}}-values that can produce many primes in the given range of exponent {{Vn}} :# Low-weight {{Vk}}-values that produce a very small number of primes (opposite to (1) above)
    845 bytes (120 words) - 02:21, 1 May 2024
  • Nomenclature and notation
    ...h>2^{127}-1</math> or other [[List of known Mersenne primes|known Mersenne primes]] as M61, M127, or such. The reader will generally understand that in case
    3 KB (467 words) - 20:32, 14 February 2019
  • Seventeen or Bust/Primes
    *[https://primes.utm.edu/primes/search.php All SoB primes]
    2 KB (163 words) - 14:20, 7 March 2019
  • Seventeen or Bust/FAQ
    *[[Seventeen or Bust/Primes|Primes]]: Primes found and open values.
    550 bytes (87 words) - 13:39, 1 February 2019
  • Seventeen or Bust/Sieving
    ...still be very pleasing. The drawback of sieving is that you'll never find primes by sieving, like [[Seventeen or Bust/Factoring|factoring]].
    2 KB (363 words) - 13:41, 1 February 2019
  • Seventeen or Bust/PRP
    ...his is the part where workers actually find new [[Seventeen or Bust/Primes|primes]]. This is the easiest part of the project.
    888 bytes (145 words) - 13:40, 1 February 2019
  • Why participate in GIMPS?
    ...://www.utm.edu/research/primes/notes/faq/why.html Why do people find these primes?] ...numbers (no odd perfect numbers are known) are all closely related to the primes of the form 2<sup>p</sup>-1, for some prime ''p'' (now called [[Mersenne pr
    7 KB (1,252 words) - 09:47, 7 March 2019
  • Sieving
    If we need to find prime numbers, for all primes between 2 and the square root of the maximum member of the sequence, set to ...s less than the computed square root, this procedure can fail, because all primes less than that value will be marked as composites. But this can be fixed ea
    3 KB (521 words) - 11:14, 6 February 2019
  • Sieving program
    ...f numbers of the form k&times;2<sup>n</sup>+/-1) http://www.underbakke.com/primes/
    2 KB (220 words) - 11:42, 7 March 2019
  • NewPGen
    *k&times;n#±1 (twin primes) ...nds of primes you ought to rapidly sieve out any k or n divisible by small primes. Since it works with a large set of numbers and uses fast implementations,
    3 KB (529 words) - 09:32, 7 March 2019
  • Sophie Germain prime
    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
  • M13
    *[[List of known Mersenne primes]]
    419 bytes (48 words) - 14:50, 19 September 2021
  • M14
    *[[List of known Mersenne primes]]
    420 bytes (48 words) - 14:49, 19 September 2021
  • M15
    *[[List of known Mersenne primes]]
    430 bytes (49 words) - 14:49, 19 September 2021
  • M16
    *[[List of known Mersenne primes]]
    431 bytes (49 words) - 14:49, 19 September 2021
  • M17
    *[[List of known Mersenne primes]]
    431 bytes (49 words) - 14:49, 19 September 2021
  • M18
    *[[List of known Mersenne primes]]
    415 bytes (47 words) - 22:26, 17 February 2019
  • M11
    *[[List of known Mersenne primes]]
    412 bytes (47 words) - 14:23, 17 February 2019
  • M10
    *[[List of known Mersenne primes]]
    403 bytes (44 words) - 13:54, 17 February 2019
  • Proth prime
    ...e form {{Kbn|+|k|n}} with 2<sup>''n''</sup> > ''k'' are often called Proth primes. *[http://primes.utm.edu/glossary/page.php?sort=ProthPrime Definition from The Prime Glossar
    656 bytes (91 words) - 07:02, 31 August 2020
  • Riesel prime
    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
  • Riesel Sieve
    ...is the smallest possible [[Riesel number]]). To do that, they have 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
  • The Prime Pages
    *[https://t5k.org/primes/status.php Prime Verification Status] *[https://t5k.org/primes/ The List of Largest Known Primes Home Page]
    527 bytes (83 words) - 22:28, 29 April 2024
  • M26
    *[[List of known Mersenne primes]]
    455 bytes (52 words) - 23:01, 17 February 2019
  • Introductory stuff
    ...on-Intel code]] that doesn't even use [[PrimeNet]]. Moreover, new Mersenne primes are rare and anyone can check new ones out at any time. Therefore, such a c ...ouple of weeks. Many Mersenne candidates are multiples of relatively small primes. Trial factoring discovers if there is such a number. If it is, the more ex
    14 KB (2,370 words) - 15:15, 17 August 2019
  • What use are prime numbers anyway?
    ...So that if a and b are prime, when a x b = c then a and b are the only two primes that will multiply together to make c. During the 1970s three American scie ...o create this composite number. Since factoring big composite numbers into primes is not a trivial matter, anyone interested in trying to break these codes m
    3 KB (497 words) - 07:17, 22 May 2020
  • Glossary
    *'''[[Mersenne prime]]''' - Primes of the type <math>2^n-1</math> (implying n is also prime). *[https://primes.utm.edu/glossary/ Prime Glossary] at [[The Prime Pages]]
    1 KB (190 words) - 10:55, 7 March 2019
  • Overclocking
    ...he GIMPS program that is involved in the search for the very rare Mersenne primes. The very useful, for overclockers, feature of Prime95 is the Torture test,
    14 KB (2,326 words) - 15:17, 11 February 2019
  • PRPNet
    Several [[distributed computing]] projects use PRPclient to find primes, including:
    531 bytes (63 words) - 13:36, 5 November 2023
  • MasterPrime 2006
    416 bytes (52 words) - 15:11, 7 February 2019
  • Multiple polynomial quadratic sieve
    ...<math>u</math> is the product of small [[prime]] numbers. The set of these primes is the ''factor base''. These relations will be found using [[sieving]] as ...th> modulo any prime of the factor base. This means that about half of the primes cannot be in the factor base because <math>N</math> cannot be a [[quadratic
    6 KB (1,068 words) - 14:33, 13 February 2019
  • 27121 Search
    ...7121 Search has currently 12 primes in the [[The Prime Pages]]. The bigger primes are 27 &times; 2<sup>1902689</sup>-1 and 27 &times; 2<sup>2218064</sup>+1,
    983 bytes (138 words) - 13:25, 8 February 2019
  • 12121 Search
    ...[[prime]]s of the form: 121 &times; 2<sup>n</sup>-1, it also searches for primes of 121 &times; 2<sup>n</sup>+1 after being a partner of [[PrimeGrid]]. The 12121 Search has currently 7 primes in the [[The Prime Pages]], their largest number is 121 &times; 2<sup>20339
    984 bytes (143 words) - 13:30, 8 February 2019
  • GIMPS chances of finding a prime number
    ...like a river broadening as it slows down, and there are [[twin prime]]s - primes that are only 2 apart like 612,107 and 612,109 - and this makes matters mor ...east one prime in the gap between your two numbers. But that refers to all primes, whereas GIMPS is only looking for [[Mersenne prime]]s, and Chebyshev's res
    3 KB (593 words) - 10:09, 7 March 2019
  • Strong law of small numbers
    ...ble Mersenne number]]s are a good example of this. The first 4 terms yield primes, but factors for next four terms have been found (after a gap of over 80 ye [[Chris Caldwell]] has an excellent page on this [http://primes.utm.edu/glossary/page.php?sort=LawOfSmall here].
    1 KB (197 words) - 15:02, 11 February 2019
  • GIMPS PrimeNet reports
    '''Known Primes''' links to Chris [[Chris Caldwell]]'s "Prime Pages" table of known [[Merse
    7 KB (1,137 words) - 15:30, 13 August 2020
  • Sierpiński-Riesel Base 5
    ...e smallest possible [[Riesel number base 5]]. To prove this, one must find primes for all {{Vk}} below the smallest known number. ...test (for primality). After that, users unreserve their {{Vk}} again if no primes are found. Instructions to the project can be found at [http://www.geocitie
    2 KB (231 words) - 11:42, 5 October 2020
  • 15k Search
    :In order to do this we use the fastest programs possible to return primes of special forms. ...nes, written by Paul Jobling, novice users will be more likely to look for primes, and will find them quicker.
    3 KB (517 words) - 14:51, 15 February 2019
  • Milestones report
    2 KB (298 words) - 12:39, 19 February 2019
  • PrimeNet summary report
    ...in this column will not change, since it is trivial to find and count all primes in these ranges. *'''P''': The number of Mersenne primes found (so far and verified) in this range.
    7 KB (1,072 words) - 13:10, 19 February 2019
  • GIMPS milestones
    ...M36]] = M(2976221) and [[M37]] = M(3021377) are the 36th and 37th Mersenne primes. ...[[M32]] = M(756839) and [[M33]] = M(859433) are the 32nd and 33rd Mersenne primes.
    5 KB (691 words) - 08:59, 20 February 2019
  • Riesel problem 1
    |+First primes for odd Riesel {{Vk}}-values < {{Num|509203}}<br>by power-of-two range {{Navbox Riesel primes}}
    6 KB (689 words) - 18:14, 4 April 2024
  • Tutorial LLR
    ...ewPGen-file in Input file and choose a name for the Output file (where the primes are reported) ...(the icon changes from red to green). You can check the primes.log for new primes if you want.
    2 KB (337 words) - 13:24, 20 February 2019
  • RMA.NET
    ...ftware, can be used by the [[15k Search]], or anyone interested in finding primes. Finding titanic primes is now easy for everyone!
    2 KB (353 words) - 14:53, 20 February 2019
  • Cullen number
    ==Cullen primes== *see [[Cullen prime 2|Cullen primes]]
    2 KB (252 words) - 17:39, 31 August 2021
  • Mtsieve
    2 KB (338 words) - 06:58, 28 March 2023
  • Carol-Kynea prime
    ...y [[Cletus Emmanuel]] starting in 1995, the search for new Carol and Kynea primes is now coordinated in a [[MersenneForum]] thread, and the results are store ...ther base’s primes (ex. Base 4 Carol/Kynea primes are Base 2 Carol/Kynea primes where <math>n \bmod 2 \equiv 0</math>). So it is not necessary to search th
    8 KB (1,172 words) - 00:38, 6 July 2023
  • Multifactorial Prime Search
    572 bytes (74 words) - 14:47, 20 July 2021
  • Riesel prime 2 1
    *[[List of known Mersenne primes]]
    2 KB (288 words) - 11:41, 3 April 2023
  • Riesel 2 Low-weight
    {{Navbox Riesel primes}}
    948 bytes (121 words) - 13:08, 21 July 2021
  • Factorial prime
    *Factorial primes of the form ''n!-1'' are of the {{OEIS|l|A002982}}. *Factorial primes of the form ''n!+1'' are of the {{OEIS|l|A002981}}.
    488 bytes (70 words) - 07:11, 1 April 2019
  • Williams prime MM 10
    |WiRemarks=These primes are [[Near-repdigit]] numbers; see [https://stdkmd.net/nrr/8/89999.htm Fact
    1 KB (143 words) - 02:41, 5 November 2020
  • Williams prime MM least
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|(b-1)|b|n}}, least {{Vn}}-values}}
    2 KB (211 words) - 07:40, 1 August 2021
  • Proth prime 2 1
    |PRemarks=These n-values form the [[Fermat number|Fermat primes]].
    212 bytes (30 words) - 15:35, 2 October 2022
  • Proth prime table
    Automatically generated table from available [[:Category:Proth prime|Proth primes]]. ==Primes table==
    750 bytes (108 words) - 14:39, 12 July 2021
  • LLR testing a range of sequences
    *{{Key|lresu00xx.txt}}: result files with residues, timings, primes
    871 bytes (147 words) - 12:29, 23 April 2019
  • Woodall prime
    {{DISPLAYTITLE:(Generalized) Woodall primes}} ...n}} are given with {{Vb}} &ge; 2, {{Vn}} &ge; 1 and listed as "Gen Woodall primes".
    1 KB (205 words) - 09:53, 13 March 2024
  • Woodall prime table
    ...matically generated table from available [[:Category:Woodall prime|Woodall primes]]. ==Primes table==
    792 bytes (106 words) - 04:19, 19 April 2023
  • Woodall prime 2
    {{DISPLAYTITLE:Woodall primes {{Kbn|n|2|n}}|noerror}}
    2 KB (230 words) - 10:36, 27 March 2023
  • Cullen prime
    {{DISPLAYTITLE:(Generalized) Cullen primes}} ...|n|b|n}} are given with {{Vb}} &ge; 2, {{Vn}} &ge; 1 and listed as "Cullen primes".
    2 KB (286 words) - 17:22, 7 May 2023
  • Cullen prime 2
    {{DISPLAYTITLE:Cullen primes {{Kbn|+|n|2|n}}|noerror}}
    2 KB (175 words) - 14:54, 19 September 2021
  • Cullen prime table
    Automatically generated table from available [[:Category:Cullen prime|Cullen primes]]. ==Primes table==
    733 bytes (100 words) - 04:19, 19 April 2023
  • Williams prime MM table
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|(b-1)|b|n}}}} ==Primes table==
    460 bytes (65 words) - 23:05, 31 July 2021
  • Williams prime MP table
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b-1)|b|n}}}} ==Primes table==
    462 bytes (65 words) - 08:05, 1 August 2021
  • Williams prime PM table
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|(b+1)|b|n}}}} ==Primes table==
    458 bytes (65 words) - 14:02, 1 August 2021
  • Williams prime PP table
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b+1)|b|n}}}} ==Primes table==
    447 bytes (65 words) - 08:12, 18 June 2019
  • Mark Rodenkirch
    *[https://www.mersenneforum.org/rogue/rogue.html Rogue primes]
    456 bytes (54 words) - 13:50, 21 March 2023
  • Williams prime MP least
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b-1)|b|n}}, least {{Vn}}-values}}
    4 KB (457 words) - 11:14, 11 May 2024
  • Williams prime PM least
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|(b+1)|b|n}}, least {{Vn}}-values}}
    1 KB (161 words) - 13:57, 1 August 2021
  • Williams prime PP least
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b+1)|b|n}}, least {{Vn}}-values}}
    2 KB (306 words) - 09:54, 7 September 2020
  • Williams prime MM remaining
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|(b-1)|b|n}}, remaining data}} ...e all remaining data given not yet available as separate page for Williams primes of the form {{Kbn|(b-1)|b|n}} for {{Vb}} < 2050.
    962 bytes (137 words) - 07:42, 1 August 2021
  • Riesel prime small bases least n
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|b|n}}, least {{Vn}}-values}} Here are listed the wanted values for which no primes were found yet.
    6 KB (684 words) - 09:40, 17 March 2024
  • Proth prime small bases least n
    {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|b|n}}, least ''n''-values}}
    7 KB (795 words) - 08:03, 5 May 2024
  • Williams prime PP remaining
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b+1)|b|n}}, remaining data}} ...e all remaining data given not yet available as separate page for Williams primes of the form {{Kbn|+|(b+1)|b|n}} for ''b'' < 1025.
    962 bytes (135 words) - 07:49, 26 June 2019
  • Williams prime PM remaining
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|(b+1)|b|n}}, remaining data}} ...e all remaining data given not yet available as separate page for Williams primes of the form {{Kbn|(b+1)|b|n}} for {{Vb}} < 1025.
    962 bytes (136 words) - 14:00, 1 August 2021
  • Williams prime MP remaining
    {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b-1)|b|n}}, remaining data}} ...e all remaining data given not yet available as separate page for Williams primes of the form {{Kbn|+|(b-1)|b|n}} for {{Vb}} < 1025.
    966 bytes (138 words) - 08:03, 1 August 2021
  • Carol-Kynea table short
    457 bytes (54 words) - 14:24, 19 June 2019
  • Carol-Kynea table alternate
    ...y generated table from available [[:Category:Carol-Kynea prime|Carol-Kynea primes]]. ==Primes table==
    974 bytes (133 words) - 13:28, 4 July 2019
  • Alexander Jones
    835 bytes (107 words) - 20:41, 30 April 2024
  • Twin prime least k
    {{DISPLAYTITLE: Twin primes of the form {{Kbn|k|n}} and {{Kbn|+|k|n}}, least {{Vk}} value}}
    993 bytes (142 words) - 09:00, 28 May 2021
  • Leyland prime P table
    {{DISPLAYTITLE:Leyland primes of the form x<sup>y</sup> + y<sup>x</sup>}}
    864 bytes (130 words) - 20:54, 15 July 2020
  • Paul Leyland
    839 bytes (122 words) - 20:22, 19 July 2019
  • NPLB Drive 18
    ==Found primes==
    656 bytes (82 words) - 21:59, 23 January 2023
  • Leyland number
    ...ime P PRP|{{Num|{{PAGESINCATEGORY:Leyland prime P PRP|pages|R}}}} probable primes]]. *[http://www.leyland.vispa.com/numth/primes/xyyx.htm Page] of Leyland numbers, dated 2006-10-06 by P.Leyland
    8 KB (906 words) - 09:59, 5 January 2023
  • Saouter number
    ...ex/docid/73966/filename/RR-2728.pdf Y.Saouter: "A Fermat-Like Sequence and Primes of the Form 2h*3^n+ 1, 1995]</ref>.
    869 bytes (128 words) - 07:02, 15 August 2019
  • Mersenne@home
    |result=no primes found, unknown number of factors found
    730 bytes (97 words) - 06:35, 16 August 2019
  • Woodall prime P 2 table
    {{DISPLAYTITLE:Near Woodall primes of the form {{Kbn|(n+1)|2|n}}}}
    4 KB (327 words) - 16:31, 31 August 2021
  • Riesel prime const 333333
    ...arks=For all primes of [[PrimeGrid]] see [https://www.primegrid.com/primes/primes.php?project=TPS&factors=+&only=ALL&announcements=ALL&sortby=size&dc=no&sear
    639 bytes (69 words) - 07:54, 19 August 2019
  • Woodall prime M 2 table
    {{DISPLAYTITLE:Near Woodall primes of the form {{Kbn|(n-1)|2|n}}}}
    3 KB (313 words) - 16:51, 31 August 2021
  • RPS Drive 10
    *Purpose: The goal of this drive is to search for primes of the form '''{{Kbn|k|n}}''' for '''128 low-weighted {{Vk}}'s with 10000 < ==Found primes==
    2 KB (290 words) - 22:54, 10 April 2024
  • Riesel 2 1-300
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Vk}} < 300}} ...matically generated table from available [[:Category:Riesel 2 1-300|Riesel primes {{Vk}} < 300]].
    855 bytes (117 words) - 07:27, 16 July 2021
  • TOPS
    ...rch for large generalized Cullen/Woodall primes. Breaking records, finding primes for primeless bases! In the future we plan to expand to near-repdigits, pal :(1) Generalized Cullen/Woodall primes, started in 2011.
    851 bytes (109 words) - 23:37, 25 February 2020
  • NPLB Drive 14
    ==Found primes==
    427 bytes (56 words) - 14:44, 23 January 2023
  • RPS Megabit Drive 1
    The goal of this drive is to search for primes of the form {{Kbn|k|n}} for {{Vk}} &le; 300 and {{Vn}} > 1000000.
    4 KB (439 words) - 10:45, 9 May 2024
  • RPS Megabit Drive 2
    The goal of this drive is to search for primes of the form {{Kbn|k|n}} for {{Vk}} &le; 300 and {{Vn}} > 1000000.
    4 KB (376 words) - 21:41, 8 May 2024
  • RPS Megabit Drive 3
    The goal of this drive is to search for primes of the form {{Kbn|k|n}} for {{Vk}} &le; 300 and {{Vn}} > 1400000.
    2 KB (155 words) - 07:18, 7 May 2024
  • Riesel 2 10e4-10e5
    __NOTOC__{{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Num|10000}} &le; {{Vk}} &le; {{Num|25000}}}} ==Primes table==
    1 KB (176 words) - 09:20, 22 July 2021
  • Riesel 2 4000-6000
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 4000 < {{Vk}} < 6000}} ...cally generated table from available [[:Category:Riesel 2 4000-6000|Riesel primes 4000 < {{Vk}} < 6000]].
    883 bytes (117 words) - 08:42, 22 July 2021
  • Riesel 2 300-2000
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 300 < {{Vk}} < 2000}} ...ically generated table from available [[:Category:Riesel 2 300-2000|Riesel primes 300 < {{Vk}} < 2000]].
    878 bytes (117 words) - 08:27, 22 July 2021
  • RPS Drive 7
    *Purpose: The goal of this drive is to search for primes of the form {{Kbn|k|n}} for 21 high-weighted 2200 < {{Vk}} < 3000. ==Found primes==
    1 KB (123 words) - 03:03, 17 April 2024
  • NPLB Drive 15
    ==Found primes==
    426 bytes (56 words) - 11:07, 5 June 2022
  • NPLB Maxi Drive 1
    ==Found primes==
    576 bytes (60 words) - 11:57, 5 September 2021
  • NPLB Drive 3
    ==Found primes==
    392 bytes (48 words) - 11:52, 5 September 2021
  • NPLB Drive 13
    ==Found primes==
    426 bytes (56 words) - 14:43, 23 January 2023
  • NPLB Drive 5
    ==Found primes==
    395 bytes (48 words) - 11:48, 5 September 2021
  • Riesel 2 10e5-10e6
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>5</sup> < {{Vk}} < 10<sup>6</sup>}} ...cally generated table from available [[:Category:Riesel 2 10e5-10e6|Riesel primes 10<sup>5</sup> < {{Vk}} < 10<sup>6</sup>]].
    1 KB (153 words) - 09:34, 22 July 2021
  • Generalized Fermat 262144
    {{DISPLAYTITLE:Generalized Fermat primes of the form {{Kbn|+|1|k|262144}}}}
    988 bytes (118 words) - 00:24, 6 August 2021
  • Riesel 2 10e6-10e7
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>6</sup> < {{Vk}} < 10<sup>7</sup>}} ...cally generated table from available [[:Category:Riesel 2 10e6-10e7|Riesel primes 10<sup>6</sup> < {{Vk}} < 10<sup>7</sup>]].
    1 KB (153 words) - 09:46, 22 July 2021
  • Riesel 2 10e7-10e8
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>7</sup> < {{Vk}} < 10<sup>8</sup>}} ...cally generated table from available [[:Category:Riesel 2 10e7-10e8|Riesel primes 10<sup>7</sup> < {{Vk}} < 10<sup>8</sup>]].
    1 KB (153 words) - 09:58, 22 July 2021
  • Riesel 2 10e8-10e9
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>8</sup> < {{Vk}} < 10<sup>9</sup>}} ...cally generated table from available [[:Category:Riesel 2 10e8-10e9|Riesel primes 10<sup>8</sup> < {{Vk}} < 10<sup>9</sup>]].
    1 KB (153 words) - 10:00, 22 July 2021
  • Riesel 2 10e9-10e10
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 10<sup>9</sup> < {{Vk}} < 10<sup>10</sup>}} ...ally generated table from available [[:Category:Riesel 2 10e9-10e10|Riesel primes 10<sup>9</sup> < {{Vk}} < 10<sup>10</sup>]].
    1 KB (153 words) - 10:05, 22 July 2021
  • PrimeGrid The Riesel Problem
    Finding primes for the [[Riesel problem 1]]. ===Primes found by project===
    2 KB (229 words) - 07:52, 27 March 2024
  • PrimeGrid Sierpiński base 5
    Finding primes for the [[Sierpiński number base 5]] problem. Up to date list of eliminations [https://www.primegrid.com/primes/primes.php?project=SR5 here]
    2 KB (245 words) - 11:43, 5 September 2021
  • PrimeGrid Riesel base 5
    Finding primes for the [[Sierpiński-Riesel_Base_5|Riesel base 5 problem]].
    4 KB (399 words) - 12:42, 2 March 2024
  • NPLB Drive 1
    ==Found primes==
    416 bytes (55 words) - 11:51, 5 September 2021
  • NPLB Drive 2
    ==Found primes==
    405 bytes (53 words) - 11:51, 5 September 2021
  • NPLB Drive 4
    ==Primes found==
    488 bytes (56 words) - 11:48, 5 September 2021
  • NPLB Drive 6
    ==Found Primes==
    408 bytes (56 words) - 11:49, 5 September 2021
  • NPLB Drive 7
    ==Found primes==
    409 bytes (56 words) - 11:50, 5 September 2021
  • NPLB Drive 8
    ==Primes found==
    412 bytes (56 words) - 11:50, 5 September 2021
  • NPLB Drive 9
    ==Primes found==
    383 bytes (55 words) - 12:28, 13 June 2020
  • NPLB Drive 10
    ==Primes found==
    402 bytes (56 words) - 11:55, 5 September 2021
  • NPLB Drive 11
    ==Found primes==
    615 bytes (81 words) - 11:55, 5 September 2021
  • NPLB Drive 12
    ==Found primes==
    353 bytes (48 words) - 12:32, 13 June 2020
  • PrimeGrid Sophie Germain Search
    ==Found primes== The project found over 12200 primes, with 2 Sophie Germain pairs and 2 Twin pairs. Each of these discoveries ar
    3 KB (337 words) - 15:13, 16 December 2023
  • Riesel 2 2000-4000
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 2000 < {{Vk}} < 4000}} ...cally generated table from available [[:Category:Riesel 2 2000-4000|Riesel primes 2000 < {{Vk}} < 4000]].
    883 bytes (117 words) - 08:39, 22 July 2021
  • Riesel 2 6000-8000
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 6000 < {{Vk}} < 8000}} ...cally generated table from available [[:Category:Riesel 2 6000-8000|Riesel primes 6000 < {{Vk}} < 8000]].
    883 bytes (117 words) - 08:56, 22 July 2021
  • Riesel 2 8000-10000
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, 8000 < {{Vk}} < 10000}} ...ally generated table from available [[:Category:Riesel 2 8000-10000|Riesel primes 8000 < {{Vk}} < 10000]].
    888 bytes (117 words) - 09:00, 22 July 2021
  • Riesel 2 10e10-infinity
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Vk}} > 10<sup>10</sup>}} ...generated table from available [[:Category:Riesel 2 10e10-infinity|Riesel primes {{Vk}} > 10<sup>10</sup>]].
    1 KB (146 words) - 10:08, 22 July 2021
  • RPS Drive 9
    *Purpose: The goal of this drive is to search for primes of the form {{Kbn|k|n}} for 40 high-weighted 10000 < {{Vk}} < 30000. ==Found primes==
    2 KB (151 words) - 10:56, 11 January 2023
  • Riesel 2 Riesel
    {{Navbox Riesel primes}}
    808 bytes (110 words) - 21:12, 17 December 2023
  • Riesel 2 Count-100
    {{DISPLAYTITLE:Riesel numbers of the form {{Kbn|k|n}} with 100 and more primes}} {{Navbox Riesel primes}}
    911 bytes (120 words) - 21:56, 25 July 2021
  • Riesel 2 15k-value
    {{Navbox Riesel primes}}
    1 KB (156 words) - 06:59, 16 July 2021
  • Riesel 2 2145k-value
    {{Navbox Riesel primes}}
    1 KB (156 words) - 07:01, 16 July 2021
  • Riesel 2 2805k-value
    {{Navbox Riesel primes}}
    1 KB (156 words) - 07:08, 16 July 2021
  • RPS K17 Drive
    *Purpose: The goal of this drive is to search for primes of the form {{Kbn|17|n}} for {{Vn}} ≥ 205000. ==Found primes==
    526 bytes (65 words) - 13:07, 5 May 2024
  • Riesel 2 Count-0
    {{Navbox Riesel primes}}
    871 bytes (117 words) - 21:46, 25 March 2024
  • Liskovets-Gallot conjectures
    ...ontinuing the [[CRUS Liskovets-Gallot]] subproject to find the remaining 9 primes required to prove the other 3 conjectures. [[Valery Liskovets]] studied the list of {{Kbn|+|k|n}} primes and observed, that the {{Vk}}'s ({{Vk}} divisible by 3)
    2 KB (367 words) - 12:42, 9 May 2024
  • CRUS Liskovets-Gallot
    ...|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes for {{Vn}}-values of a given parity. ...th prime]]s, then also for [[Riesel prime]]s), divisible by 3, that had no primes of a given parity. This was proven by [[Yves Gallot]], who provided example
    7 KB (957 words) - 22:40, 10 June 2023
  • Riesel prime 2 192335307
    25000;115382;C:[[Consecutive primes arithmetic progression]] ({{V|d}}=5130) with {{T5000|115383|192335307*2<sup
    580 bytes (47 words) - 16:00, 25 July 2021
  • Riesel 2 3k-value
    {{Navbox Riesel primes}}
    1 KB (153 words) - 06:55, 16 July 2021
  • Statistics
    | [[:Category:Mersenne prime|Mersenne primes]] || number || style="text-align:right;"|{{Num|{{#expr:{{PAGESINCATEGORY:Me | [[:Category:Riesel 2|Riesel primes {{Kbn|k|2|n}}]] || {{Vk}}-value || style="text-align:right;"|{{Num|{{PAGESI
    11 KB (1,385 words) - 17:23, 5 April 2024
  • Riesel prime 10
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|10|n}}}} *[http://www.noprimeleftbehind.net/gary/primes-kx10n-1.htm Primes of the form {{Kbn|k|10|n}}] compiled by [[Gary Barnes]]
    681 bytes (93 words) - 13:01, 2 August 2021
  • Riesel 2 10e4-10e5a
    __NOTOC__{{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}}, {{Num|25000}} &le; {{Vk}} &le; {{Num|100000}}}} ==Primes table==
    1 KB (165 words) - 09:15, 22 July 2021
  • RPS Drive 12
    *Purpose: The goal of this drive is to search for primes of the form {{Kbn|k|2|n}} for 13 high-weighted 2000 < {{Vk}} < 2300. ==Found primes==
    537 bytes (60 words) - 10:53, 11 January 2023
  • Riesel 2 Missing-range
    {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|n}} with missing ranges}} ...sually due to a prime being found as part of a project drive, searches for primes with special forms, or constant-{{Vn}} searches.
    1 KB (192 words) - 09:07, 23 September 2021
  • Riesel prime 2 49185
    {{HistC|2009-12-22|50000|Kenneth Egtved Pedersen|199611}}, missed small primes
    701 bytes (51 words) - 15:17, 1 August 2021
  • PrimeGrid Prime Sierpiński Problem
    There are also no known primes for {{Vk}} = [[Proth prime 2 22699|22699]] and [[Proth prime 2 67607|67607]
    2 KB (254 words) - 11:43, 5 September 2021
  • PrimeGrid Generalized Cullen Prime Search
    ...primes]] of the form {{Kbn|+|n|b|n}} for bases {{Vb}} which have no known primes. ==Found primes==
    2 KB (203 words) - 17:29, 7 May 2023
  • PrimeGrid Cullen Prime Search
    ...[Proth prime 6679881|{{Kbn|+|6679881|2|6679881}}]] ([http://primes.utm.edu/primes/page.php?id=89536 2,010,852 digits]) ...[Proth prime 6328548|{{Kbn|+|6328548|2|6328548}}]] ([http://primes.utm.edu/primes/page.php?id=87775 1,905,090 digits])
    753 bytes (97 words) - 08:45, 12 September 2021
  • Proth 2 3k-value
    {{Navbox Proth primes}}
    1 KB (156 words) - 09:18, 23 July 2021
  • ToDo
    *list/table of Twin/SG primes with index *How to save information, if tested for Twin primes (for Riesel/Proth primes)?
    790 bytes (110 words) - 09:54, 9 October 2020
  • CRUS Even Riesel
    .../mersenneforum.org/showthread.php?t=9830 Bases 2 & 4 reservations/statuses/primes]
    305 bytes (30 words) - 09:39, 7 November 2022
  • PrimeGrid Fermat Divisor Search
    ...mat divisors.<ref>[https://www.primegrid.com/forum_thread.php?id=8783 What primes can be Fermat divisors? - PrimeGrid Forums]</ref> ==Found primes==
    4 KB (448 words) - 09:13, 7 September 2021
  • Riesel prime 2 13236795
    {{HistC|2021-04-03|1000000|Gary Barnes|575064}}, double-check, 7 missing primes found, results for {{Vn}}<=1000000 included
    4 KB (351 words) - 08:42, 23 March 2024
  • Florian Baur
    Currently working on primes of the form {{NPr|1281979|n}}: {{Vn}} < {{Num|{{GP|Proth prime 2 1281979|PM
    271 bytes (34 words) - 15:09, 22 December 2023
  • Riesel problem 2
    ...lt; 762701, the first and second Riesel {{Vk}}-values without any possible primes. {{Navbox Riesel primes}}
    4 KB (386 words) - 06:41, 29 March 2024
  • 2nd Riesel Problem
    Finding primes for the [[Riesel problem 2]]. ===Primes found by project===
    1 KB (140 words) - 07:49, 27 March 2024
  • Free-DC Drive 1
    ==Primes found==
    306 bytes (38 words) - 10:25, 15 May 2021
  • Free-DC Drive 2
    Suspended at [https://www.free-dc.org/showthread.php?26443-Report-primes-from-the-high-weight-drive-port-7772-Closed&p=149249&viewfull=1#post149249 ==Primes found==
    439 bytes (50 words) - 10:48, 15 May 2021
  • Free-DC Drive 3
    ==Primes found==
    292 bytes (36 words) - 10:32, 15 May 2021
  • PrimeGrid 321 Prime Search
    ==Primes found== '''Total:''' 15 primes found
    3 KB (335 words) - 08:20, 7 July 2023
  • NPLB Drive 9A
    ==Primes found==
    440 bytes (59 words) - 11:51, 5 September 2021
  • NPLB Drive 9B
    ==Primes found==
    441 bytes (59 words) - 11:52, 5 September 2021
  • NPLB Drive 9C
    ==Primes found==
    441 bytes (59 words) - 11:54, 5 September 2021
  • NPLB Drive 9D
    ==Primes found==
    441 bytes (59 words) - 11:55, 5 September 2021
  • Proth 2 15k-value
    {{Navbox Proth primes}}
    1 KB (156 words) - 09:22, 23 July 2021
  • Proth 2 2145k-value
    {{Navbox Proth primes}}
    1 KB (156 words) - 09:36, 23 July 2021
  • Proth 2 2805k-value
    {{Navbox Proth primes}}
    1 KB (158 words) - 09:16, 22 March 2024
  • Proth 2 1-300
    {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}}, {{Vk}} < 300}} Automatically generated table from available [[:Category:Proth 2 1-300|Proth primes {{Vk}} < 300]].
    850 bytes (117 words) - 17:18, 25 July 2021
  • Proth 2 Sierpinski
    {{Navbox Proth primes}}
    741 bytes (99 words) - 21:18, 17 December 2023

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

Retrieved from "https://www.rieselprime.de/ziki/Special:Search"