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

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