Search results

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}}₀,...,{{V|F}}₄. ...he sequence {{{V|p}}_{{Vn}}} 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

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