Search results

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

• 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
• Examples
  The <b>[[:Category:Carol-Kynea_prime|category]]</b> for Carol/Kynea primes holds example pages for some bases. The data are collected from the internal SQL database by [https://www.mediawiki.org/wiki/Extension:External_Data Extension:External
  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 *'''Date''': year/date of discovery, if available a link to the press release by [[GIMPS]]
  2 KB (360 words) - 09:44, 6 March 2019
• Mersenne prime
  ...minus; 1 = {{Kbn|4}}, for example, is not a prime, because 15 is divisible by 3 and 5. ...enerally, [[Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are one less than a power of two; hence,
  5 KB (857 words) - 14:53, 19 September 2021
• Leonhard Euler
  | Name=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
  | Name=Marin Mersenne .... It is sometimes incorrectly stated that he was a Jesuit. He was educated by Jesuits, but he never joined the Society of Jesus. He taught theology and p
  11 KB (1,582 words) - 01:17, 15 January 2024
• Landon Curt Noll
  | Name=Landon Curt Noll ...8. This brought them quite a bit of attention. Their discovery was covered by national television news and reported in the New York times on 1978-11-21.
  2 KB (333 words) - 12:40, 9 February 2022
• Fermat number
  ...ber, and such primes are called '''Fermat primes'''. The only known Fermat primes are {{V|F}}₀,...,{{V|F}}₄. for {{Vn}} &ge; 2. Each of these relations can be proved by [[Proof by induction|mathematical induction]]. From the last equation, we can deduce '
  12 KB (1,913 words) - 14:35, 9 August 2021
• Derrick Henry Lehmer
  | Name=Derrick Henry Lehmer ...om his father, [[Derrick Norman Lehmer]] who was also a mathematician, and by his friends as Dick. In this article Derrick or Lehmer means the son, DNL m
  6 KB (1,033 words) - 01:13, 15 January 2024
• 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
  ...d for one value by Aurifeuille and the general form was subsequently given by Lucas. Here are the Aurifeuillian factorizations for the other bases. ...<math>x-1</math>. In such cases, <math>b^n-1 \over b-1</math> is divisible by <math>n</math> itself.
  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]] ( ...s result was verified by Tuckerman of [[IBM]]'s Watson Research Center and by Lehmer at UC Berkeley.
  2 KB (303 words) - 11:01, 26 February 2019
• Lucas-Lehmer test
  ...either composite or prime. It is the last stage in the procedure employed by [[GIMPS]] for finding [[Mersenne prime]]s. Previous stages try to find fact ...= 1 (mod 4), but for all odd prime exponents. The test therefore takes its name from the two mathematicians who invented and developed it, even though they
  20 KB (3,572 words) - 14:30, 17 February 2019
• Factoring Database
  ...atabase''' is a database of [[factor]]s of numbers of any kind, programmed by Markus Tervooren. **Inverse home primes of various bases
  1 KB (144 words) - 13:44, 24 January 2019
• Mlucas
  ...[Mersenne number]]s, and Pépin tests of [[Fermat number]]s. It is written by [[Ernst Mayer]] using C programming language and [[ARM]] assembly. It also ...er be lucky as to find a new prime eligible for the monetary prize offered by the [[Electronic Frontier Foundation]].
  1 KB (198 words) - 07:28, 22 August 2019
• M47
  On 2018-04-08 all tests below 2^{{{Num|43112609}}}-1 were verified by [[GIMPS]], officially making it the 47th Mersenne prime. ...Bug]] or a random bit error or [[software]], the number had to be verified by running the Lucas-Lehmer test on at least one different machine (not just a
  5 KB (694 words) - 13:17, 21 August 2019
• Prime95
  ...s the freeware computer program written by [[George Woltman]] that is used by [[Great Internet Mersenne Prime Search|GIMPS]], a [[distributed computing]] ...f December 2018, Prime95 was used to discover all 17 Mersenne primes found by GIMPS.
  11 KB (1,586 words) - 12:24, 7 August 2021
• CUDALucas
  '''CUDALucas''' is a [[CUDA]]-based program written by [[Shoichiro Yamada]] for testing [[Mersenne number]]s for primality with [[ ...itself a port to FFTW of a program tracing its roots back to original code by [[Richard Crandall]] et al.[http://www.ece.neu.edu/groups/nucar/GPGPU4/file
  2 KB (275 words) - 11:11, 21 August 2019
• Glucas
  ...IMPS]] effort to search the largest primes ever found. It was written in C by Guillermo Ballester Valor and Klaus Kastents. ...51.pdf "Discrete weighted transforms and large-integer arithmetic"] (1994) by R. Crandall and B. Fagin. The library is coded in C with some assembler mac
  3 KB (426 words) - 14:21, 14 February 2019
• Distributed computing
  ...s a branch of [[computational science]] that tries to solve large problems by giving small parts of the problem to many computers to solve and then combi ...access to massive computing power that would not otherwise be obtainable. By joining one of these distributed computing projects, you can play an import
  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
  ...z machine it took about 60 hours to [[double check]] the number. Woltman, by happenstance, was 95% of the way through a check on that ''very'' number, w ...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
  3 KB (513 words) - 08:42, 18 February 2019
• No Prime Left Behind
  ...} with odd {{Vk}} and 300 < {{Vk}} < 1001 and {{Vn}} > 260000 not reserved by others with highly presieved ranges.
  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
• Mersennewiki
  Using the old database many pages were restored for this new Wiki in 2019 by [[:User:Karbon|Karbon]].
  647 bytes (99 words) - 12:09, 25 February 2019
• Trial factoring
  Such a table can be prepared automatically, usually by an adaption of the [[Sieve of Eratosthenes]], itself requiring a small tabl ...s in using larger digit sizes. Verifying that your CPU functions correctly by testing the add, subtract, multiply and divide operations on all possible p
  7 KB (1,221 words) - 13:20, 11 February 2019
• M45
  M45 was found on 2008-09-06, by a computer owned by [[Hans-Michael Elvenich]] of Germany. The computer was running [[Prime95]] ...ww.mersenne.org/primes/m45and46.htm GIMPS Discovers 45th and 46th Mersenne Primes] (press release)
  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>). ...ath> and thus the [[Modular arithmetic#Modular division|modular division]] by <math>m \pmod{n}</math>.
  738 bytes (112 words) - 09:50, 23 January 2019
• M35
  ...t [[prime]] discovered by [[GIMPS]] and the first [[Mersenne prime]] found by a [[personal computer]]. A little more than a month earlier, [[David Slowin ...mer test]] took 88 hours to run. The primality of the number was confirmed by Slowinski. This showed the effectiveness of [[distributed computing]].
  2 KB (224 words) - 11:00, 18 February 2019
• University of California, Los Angeles
  ...Angeles (UCLA)''' is the largest of the University of California campuses (by enrollment). It is situated in the Westwood area of Los Angeles. It has a l Prior to the Internet, 7 Mersenne primes were discovered at UCLA
  2 KB (347 words) - 14:54, 19 September 2021
• Raphael M. Robinson
  |Name=Raphael Mitchel Robinson ...essentially undecidable theory need not have an infinite number of axioms by coming up with a counterexample: Robinson arithmetic ''Q''. ''Q'' is finite
  4 KB (526 words) - 14:51, 19 September 2021
• M36
  ...be [[prime]] on 1997-08-24 by [[Gordon Spence]], using [[Prime95]] written by [[George Woltman]]. At time of its discovery, it was the largest known prim ...puter|supercomputer]] by [[David Slowinski]], discoverer of seven Mersenne primes between 1979 and 1996.
  2 KB (279 words) - 11:01, 18 February 2019
• Sierpiński problem
  The '''Sierpiński problem''' in [[number theory]] was proposed by [[Wacław Sierpiński]] in 1960. 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
• Seventeen or Bust
  ..., we try to eliminate as many non-prime numbers as possible from the queue by [[sieving]], which means to take a (relatively) small integer and check whe ...pair]] in a few hours before running a test which will take several weeks, by [[p-1 factorization method|p-1]] factoring.
  3 KB (544 words) - 16:44, 21 July 2019
• Perfect number
  [[Euclid]] discovered that the first four perfect numbers are generated by the formula 2^''n''-1(2^''n''-1): ...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
  6 KB (885 words) - 11:33, 7 March 2019
• M9
  ...rior to the developement of the Lucas test all Mersenne primes were proved by some form of [[trial factoring]]. Pervushin used the [[Lucas-Lehmer test]] *[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 ...ry to get the tests down to the "weeks" range. The assembler cuts the time by at least another factor of two over straight C.
  8 KB (1,218 words) - 15:37, 13 August 2020
• Mfakto
  *First announced 07-Jun-2011 by Bdot. ...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)
  17 KB (2,524 words) - 12:39, 24 January 2019
• Riesel and Proth Prime Database
  It was created in 2007 and is maintained by [[:User:Karbon|Karsten Bonath]].
  380 bytes (59 words) - 14:14, 24 January 2019
• Primality test
  ...test for numbers less than 10000 digits, especially with the improvements by Mihailescu. But ECPP is preferred because of the certificates it provides.
  3 KB (501 words) - 05:20, 3 August 2021
• Mprime (Cray)
  '''mprime''' was the [[software]], initially authored by [[David Slowinski]] (later versions with [[Paul Gage]]), for testing [[Mers ...of very large numbers. This represented an advance over the software used by [[Landon Curt Noll]] &amp; [[Laura A. Nickel]]. Noll had suggested the use
  639 bytes (92 words) - 12:02, 7 February 2019
• Probable prime
  ...e prime: an [[integer]] that satisfies a specific condition also satisfied by all [[prime]] numbers.}} ...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
• 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 ...and furthermore must also leave a remainder of either 1 or 7 upon division by 8. See below for an explanation.
  6 KB (962 words) - 10:08, 7 March 2019
• Ten million digits
  ...of {{Num|33219281}} and higher). When first made available and handed out by [[PrimeNet]], the [[Lucas-Lehmer test]]s of these [[exponent]]s took over a ...009 a third prime greater that {{Num|10000000}} digits was found, [[M46]]. By the end of 2010, all exponents that would produce a number less than {{Num|
  979 bytes (146 words) - 14:23, 6 March 2019
• Brent-Suyama extension
  ...S=3^E where E is the product of prime powers less than B1. Then by [[Fermat's Little Theorem]], a prime number p | S-1 if p-1 | E. Slicker would be to note that all primes > 3 are of form 6k+/-1. Suppose instead that we compute T=S<sup>(6k)^{2<
  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
  It is a port of [[Genefer]] to [[CUDA]] by [[Shoichiro Yamada]]. It was also ported for AMD video cards.
  362 bytes (48 words) - 09:20, 29 January 2019
• Generalized Fermat number
  Saouter has proven that <math>F_{n,2}</math> numbers can be proven prime by using [[Pépin's test]] with k=5. In 1985, Dubner for the first time built a list of large primes of the form: b^{2^m}+1, ''b &ge; 2'' and ''m &ge; 1''.
  5 KB (726 words) - 09:57, 12 September 2021
• 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). ...chine and with a different [[offset]]. Ensures that a prime was not missed by error.
  4 KB (603 words) - 02:31, 18 August 2019
• PrimeNet server
  ...s taken over by [[Aaron Blosser]], and site maintenance (''Mersenne.org'') by Aaron Blosser and [[James Heinrich]]. ...and both software packages, the range of GIMPS [[exponent]]s being handled by PrimeNet increased from [[79.3 million]] to 999,999,999.
  2 KB (381 words) - 14:05, 21 August 2019
• 100 Million Digit Prefactor Project
  ...and can be used to take exponents to a [[bit level]] higher than practical by using Prime95 alone. Factor5 can be found at: [http://www.moregimps.it/bill The project started with the introduction of 'Factor' by [[Luigi Morelli]]. It was handled using a Geocities website and e-mail. Aft
  3 KB (534 words) - 10:06, 7 March 2019
• 321 Search
  '''''This project is maintained by [[PrimeGrid]] now.''''' These are the simple steps needed to participate in the 321 Search for primes.
  1 KB (185 words) - 09:34, 3 August 2021
• Sieve of Eratosthenes
  ...be <math>2</math>. Since every second number after that will be divisible by <math>2</math>, we cross out every second number; all such numbers are comp ...ry third number which hasn't been crossed out already; these are divisible by <math>3</math> and so are composite.
  4 KB (654 words) - 11:10, 6 February 2019
• Amazon EC2
  ...al computers on which they run their own applications. The service is paid by second hence the term "elastic". 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
  ...only '''prime''') is an [[integer]] greater than 1 that is only divisible by itself and 1. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19. ...dea of a 'largest prime' is fiction. And, if there is no largest prime the primes must be infinite.
  2 KB (447 words) - 00:22, 10 July 2023
• Twin prime
  ...rime''' is a [[prime|prime number]] that differs from another prime number by two, for example the twin prime pair (41, 43). ...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).
  2 KB (255 words) - 06:08, 21 February 2023
• Riesel Prime Search
  ...sel Prime Search''' (RPS) is a prime searching project established in 2005 by [[Predrag Minovic]] (Kosmaj). :# {{Vk}}-values that can produce many primes in the given range of exponent {{Vn}}
  845 bytes (120 words) - 02:21, 1 May 2024
• Seventeen or Bust/Primes
  These are the [[prime|prime numbers]] found by the [[Seventeen or Bust]] project so far. *[https://primes.utm.edu/primes/search.php All SoB primes]
  2 KB (163 words) - 14:20, 7 March 2019
• Seventeen or Bust/FAQ
  '''Note:''' You can help expand this list by adding your questions or creating new articles and linking them here. *[[Seventeen or Bust/Primes|Primes]]: Primes found and open values.
  550 bytes (87 words) - 13:39, 1 February 2019
• Seventeen or Bust/Sieving
  ...be very pleasing. The drawback of sieving is that you'll never find primes by sieving, like [[Seventeen or Bust/Factoring|factoring]]. ...hoice is [http://www.aooq73.dsl.pipex.com/sobsieve_1_34.zip SoBSieve 1.34] by Paul Jobling. Be warned, though, that this client is 40% slower than proth_
  2 KB (363 words) - 13:41, 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^p-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 ...than that value will be marked as composites. But this can be fixed easily by do not setting that element to 1 if the member of the sequence is equal to
  3 KB (521 words) - 11:14, 6 February 2019
• NewPGen
  '''NewPGen''' is a [[Sieving program|program]] written by Paul Jobling that is used to [[Sieving|sieve]] a set of many candidate numb *k&times;n#±1 (twin primes)
  3 KB (529 words) - 09:32, 7 March 2019
• M13
  ...is the 13th known [[Mersenne prime]] 2⁵²¹-1 found on 1952-01-30 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  419 bytes (48 words) - 14:50, 19 September 2021
• M14
  ...is the 14th known [[Mersenne prime]] 2⁶⁰⁷-1 found on 1952-01-30 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  420 bytes (48 words) - 14:49, 19 September 2021
• M15
  ...th known [[Mersenne prime]] 2^{{Num|1279}}-1 found on 1952-06-25 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  430 bytes (49 words) - 14:49, 19 September 2021
• M16
  ...th known [[Mersenne prime]] 2^{{Num|2203}}-1 found on 1952-10-07 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  431 bytes (49 words) - 14:49, 19 September 2021
• M17
  ...th known [[Mersenne prime]] 2^{{Num|2281}}-1 found on 1952-11-09 by [[Raphael M. Robinson]]. *[[List of known Mersenne primes]]
  431 bytes (49 words) - 14:49, 19 September 2021
• M18
  ...th known [[Mersenne prime]] 2^{{Num|3217}}-1 found on 1957-09-08 by [[Hans Riesel]]. *[[List of known Mersenne primes]]
  415 bytes (47 words) - 22:26, 17 February 2019
• M11
  ...s the 11th known [[Mersenne prime]] 2¹⁰⁷-1</math> found in 1914 by [[Ralph Ernest Powers]]. *[[List of known Mersenne primes]]
  412 bytes (47 words) - 14:23, 17 February 2019
• M10
  ...' is the 10th known [[Mersenne prime]] <math>2^{89}-1</math> found in 1911 by [[Ralph Ernest Powers]]. *[[List of known Mersenne primes]]
  403 bytes (44 words) - 13:54, 17 February 2019
• 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. ...testing was done independently. As values have been released from testing by individuals, the Riesel Sieve project has taken over testing them.
  2 KB (326 words) - 10:29, 26 March 2024
• The Prime Pages
  ...of [[prime]]s. It was created by [[Chris Caldwell]] in 1994 and maintained by him until 2023. *[https://t5k.org/primes/status.php Prime Verification Status]
  527 bytes (83 words) - 22:28, 29 April 2024
• M26
  ...h known [[Mersenne prime]] 2^{{{Num|23209}}}-1 found on 1979-02-09 by [[Landon Curt Noll]]. *[[List of known Mersenne primes]]
  455 bytes (52 words) - 23:01, 17 February 2019
• Introductory stuff
  ...zen bytes of information. In fact, it is possible to "check out" exponents by e-mail. Bandwidth is not likely to be a limiting factor for GIMPS. ...t, since the use of PrimeNet is not mandatory and those getting candidates by hand can try them out.
  14 KB (2,370 words) - 15:15, 17 August 2019
• What use are prime numbers anyway?
  ...or good or ill, the least difference to the amenity of the world. - Judged by all practical standards, the value of my mathematical life is nil." By which he meant that unlike say, a physicist or a chemist, his work could no
  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). *'''[[Prime|Prime number]]''' - Numbers only divisible by 1 and the number itself.
  1 KB (190 words) - 10:55, 7 March 2019
• Overclocking
  The actual speed of the processor is controlled by switches settings on the motherboard or software controlled switches in the ...otherboards will have temperature monitoring capabilities that can be read by suitable software (see the paragraph about tools). Download, install and us
  14 KB (2,326 words) - 15:17, 11 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
• GIMPS PrimeNet reports
  ...rs#supercomputer|supercomputer's]] operating status, automatically updated by the server every hour, at the start of the hour. It also shows the current ...st also includes factors found for exponents already known to be composite by way of a [[Lucas-Lehmer test]]. The list generally has more than a full day
  7 KB (1,137 words) - 15:30, 13 August 2020
• Sierpiński-Riesel Base 5
  ...Project''' is a [[distributed computing project]]. It was formerly managed by users of mersenneforum.org, and is currently a subproject on [[PrimeGrid]]. ...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
• 15k Search
  :In order to do this we use the fastest programs possible to return primes of special forms. :15k was the first such form exploited by our group, for it's heavy candidate density.
  3 KB (517 words) - 14:51, 15 February 2019
• PrimeNet summary report
  ...rs#Supercomputer|supercomputer]]'s operating status, automatically updated by the server every hour, at the start of the hour. It also shows the current Broken down by activity in the past 24 hours, 7 days, and 30 days.
  7 KB (1,072 words) - 13:10, 19 February 2019
• Riesel problem 1
  ...s smaller than {{Num|509203}} that have no known prime. These are reserved by the [[PrimeGrid The Riesel Problem|PrimeGrid Riesel Problem]] search. ...+1}. <ref>[http://www.prothsearch.com/rieselprob.html Riesel problem] by [[Wilfrid Keller]]</ref>
  6 KB (689 words) - 18:14, 4 April 2024
• Tutorial LLR
  #Start LLR by double-clicking on LLR.exe ...ewPGen-file in Input file and choose a name for the Output file (where the primes are reported)
  2 KB (337 words) - 13:24, 20 February 2019
• RMA.NET
  '''RMA.NET''' is a free program written by Shane Findley. ...ftware, can be used by the [[15k Search]], or anyone interested in finding primes.
  2 KB (353 words) - 14:53, 20 February 2019
• Mtsieve
  ...ulti-threaded sieve framework for different [[sieving program]]s developed by [[Mark Rodenkirch]].
  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 ...)^2</math> is equal to 1, and thus yields -1 when 2 is subtracted from it. By definition -1 is not prime. If {{Vn}} is negative then <math>(b^n±1)^2</ma
  8 KB (1,172 words) - 00:38, 6 July 2023
• Multifactorial Prime Search
  *[http://mfprimes.cba.pl Search] maintained by [[Marian Otremba]] *[https://www.mersenneforum.org/rogue/multifactorial.html Old search] by [[Mark Rodenkirch]]
  572 bytes (74 words) - 14:47, 20 July 2021
• Williams prime MM 10
  ...mbers; see [https://stdkmd.net/nrr/8/89999.htm Factorizations of 899...99] by [[Makoto Kamada]]<br>Search limit given at {{OEIS|l|A056725}} is the highes
  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}} *Base 128: {{NRi|127|n}} (first {{Vn}}-value divisible by 7)
  2 KB (211 words) - 07:40, 1 August 2021
• 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
• 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
• Williams prime MP least
  {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b-1)|b|n}}, least {{Vn}}-values}} *Base 512: {{NPr|511|n}} (first {{Vn}}-value divisible by 9)
  4 KB (457 words) - 11:14, 11 May 2024
• Williams prime PP least
  {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b+1)|b|n}}, least {{Vn}}-values}} Values of bases {{Vb}} ≡ 1 mod 3 are always divisible by 3, so not listed here.
  2 KB (306 words) - 09:54, 7 September 2020
• 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
• Leyland number
  ...these numbers in 1994. The first few nontrivial Leyland numbers are given by OEIS sequence {{OEIS|A076980}}. .../www.mersenneforum.org/showpost.php?p=521992&postcount=263 Leyland number] by [[Hans Havermann ]]</ref>, dates and persons of finding and proving if avai
  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
• Riesel prime const 333333
  :Not sure if such a lot of values can be handled by template. [[User:Karbon|Karbon]] ([[User talk:Karbon|talk]]) 07:54, 19 Augu ...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
• TOPS
  ...er Prime Search''' (TOPS) is a prime searching project established in 2011 by [[Predrag Minovic]] (Kosmaj) and [[Thomas Ritschel]] (Thomas11). ...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
  851 bytes (109 words) - 23:37, 25 February 2020
• 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 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
• Liskovets-Gallot conjectures
  ...ontinuing the [[CRUS Liskovets-Gallot]] subproject to find the remaining 9 primes required to prove the other 3 conjectures. ...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. ...t numbers" from [https://www.primepuzzles.net/index.shtml PP&P connection] by [[Carlos Rivera]]</ref>
  7 KB (957 words) - 22:40, 10 June 2023
• Riesel prime 10
  {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|10|n}}}} ...nd.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
• PrimeGrid Prime Sierpiński Problem
  As of {{Multi Reservation:18-Date}}, there are 7 {{Vk}}-values being searched by the project: [[Proth prime 2 79309|79309]], [[Proth prime 2 79817|79817]], 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. |resultsheader=<b>The bases currently being searched by the project</b>:
  2 KB (203 words) - 17:29, 7 May 2023
• ToDo
  ...nd [[:Template:GP|Template:GP]] for other prime types and MultiRes, needed by "Reuse Primelist" *list/table of Twin/SG primes with index
  790 bytes (110 words) - 09:54, 9 October 2020
• 2nd Riesel Problem
  Finding primes for the [[Riesel problem 2]]. ===Primes found by project===
  1 KB (140 words) - 07:49, 27 March 2024
• Readme.txt
  libcrypto*, libssl* Libraries required by libcurl. pNNNNNNN,pNNNNNNN.buN Intermediate files produced by prime95.exe to resume computation where it left off.
  3 KB (454 words) - 12:28, 7 August 2021
• Even Riesel Problem
  ...ere] and [http://www.mersenneforum.org/showthread.php?t=9440 here] started by (jasong).<br> These computations were made by [[Jens K. Andersen]] and (jasong) in Oct 2007.
  7 KB (718 words) - 10:32, 26 March 2024
• Generalized Repunit
  *[https://www.fermatquotient.com/PrimSerien/GenRepu.txt Extensive list by R.Fischer, 2024] *[http://www.primenumbers.net/Henri/us/MersFermus.htm Search by H.Lifchitz, last edit 2008]
  1 KB (177 words) - 09:22, 6 April 2024
• Drive Data test
  *Drive name: e.g. "NPLB Drive 10" *No. primes found: new and confirmed
  3 KB (372 words) - 16:57, 11 May 2024