Search results

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

Page title matches

• GIMPS chances of finding a prime number
  ...are used to calculate the probability of something happening based on the number of possible outcomes, not on what the last three or three hundred outcomes ...your next throw are 1:6. What has happened in the past does not affect the number of faces on the dice, which is all that is used to calculate the odds.
  3 KB (593 words) - 10:09, 7 March 2019

Page text matches

• Williams prime
  A '''Williams number''' is a [[natural number]] of the form {{Kbn|(b-1)|b|n}} for integers ''b'' ≥ 2 and ''n'' ≥ 1. A '''Williams prime''' is a Williams number which is [[prime]].
  5 KB (744 words) - 07:30, 5 August 2019
• Great Internet Mersenne Prime Search
  ...e Search: A [[distributed computing project]] for the search of [[Mersenne prime]]s.}} ...hat can be downloaded from the Internet, in order to search for [[Mersenne prime]] numbers.
  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 *'''n-value''': value of exponent and if available link to [[The Prime Pages]] entry
  2 KB (360 words) - 09:44, 6 March 2019
• Mersenne prime
  ...}. On the other hand, 15 = 16 − 1 = {{Kbn|4}}, for example, is not a prime, because 15 is divisible by 3 and 5. More generally, [[Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are
  5 KB (857 words) - 14:53, 19 September 2021
• Mersenne number
  A '''Mersenne number''' is a number of the form <math>2^n{-}1</math> where <math>n</math> is a non-negative [[i ...[prime]], it is called a [[Mersenne prime]], otherwise it is a [[composite number]].
  2 KB (351 words) - 11:28, 7 March 2019
• Landon Curt Noll
  ...ted in the New York times on 1978-11-21. The 18 year-olds were studying [[number theory]] at the time at CSUH with Dr. [[Derrick Henry Lehmer]] of [[Univers ...e [[multiplication]]s need in [[Lucas-Lehmer test]]ing of large [[Mersenne number]]s.
  2 KB (333 words) - 12:40, 9 February 2022
• Laura A. Nickel
  ...l and Nickel were still high school students. For the verification of this number alone, the pair used almost eight hours of time running an assembly languag
  2 KB (254 words) - 01:23, 15 January 2024
• Fermat number
  In [[mathematics]], a '''Fermat number''', named after [[Pierre de Fermat]] who first studied them, is a positive ...ese factorisations can be found at [http://www.prothsearch.com/fermat.html Prime Factors of Fermat Numbers]
  12 KB (1,913 words) - 14:35, 9 August 2021
• M50
  | number=467333183359...069762179071 '''M50''' normally refers to the 50th [[Mersenne prime]], in order of size from the smallest to greatest. This is the primary usag
  2 KB (333 words) - 13:16, 17 February 2019
• M49
  | number=300376418084...391086436351 '''M49''' normally refers to the 49th [[Mersenne prime]], in order of size from the smallest to greatest. This is the primary usag
  2 KB (283 words) - 11:50, 18 February 2019
• Derrick Henry Lehmer
  ...factoring a number ''N'' is hereby reduced to the discovery of an adequate number of quadratic residues ''R'' of ''N'' and the superposition of the correspon ...ber sieves]] to be run on a computer. He had previously built an automatic number sieve from a small electric motor and some bicycle chains hanging from spro
  6 KB (1,033 words) - 01:13, 15 January 2024
• Titanic prime
  A '''Titanic prime''' is a [[prime]] number whose decimal representation has {{Num|1000}} or more digits. The smallest titanic prime is {{T5000|58901|10⁹⁹⁹+7}}.
  394 bytes (48 words) - 11:40, 2 July 2020
• Gigantic prime
  A '''gigantic prime''' is a [[prime]] number whose decimal representation has at least {{Num|10000}} [[digit]]s. The smallest gigantic prime is 10^{{Num|9999}}+{{Num|33603}}.
  515 bytes (67 words) - 13:38, 6 March 2019
• Megaprime
  A '''Megaprime''' is a [[prime]] number whose decimal representation has {{Num|1000000}} or more digits. There are ...st 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
  A '''Gigaprime''' is a [[prime]] number whose [[decimal]] representation has {{Num|1000000000}} or more [[digit]]s. [[Operation Billion Digits]] is factoring [[Mersenne number]]s in this range.
  871 bytes (119 words) - 07:54, 14 July 2021
• Home prime
  ...me prime depends on the [[base]] (except in the case where ''n'' itself is prime). While it is expected that every ''n'' in every base has a home prime, experimental evidence indicates that these chains can get quite long.
  980 bytes (143 words) - 13:22, 6 March 2019
• Cunningham project
  ...it is considered the oldest continuously ongoing activity in computational number theory. ...exponent. The second type is [[aurifeuillian factor]], in which the whole number can be split into two parts directly, for certain combination of values of
  7 KB (1,150 words) - 23:48, 19 April 2023
• M25
  | number=448679166119...353511882751 The 25th [[Mersenne prime]], in order from smallest to largest and in order of discovery.
  2 KB (303 words) - 11:01, 26 February 2019
• Lucas-Lehmer test
  ...e last stage in the procedure employed by [[GIMPS]] for finding [[Mersenne prime]]s. Previous stages try to find factors, as explained on [[GIMPS factoring ...lete proof that this was not only true when p = 1 (mod 4), but for all odd prime exponents. The test therefore takes its name from the two mathematicians wh
  20 KB (3,572 words) - 14:30, 17 February 2019
• Édouard Lucas
  ...[[Mersenne prime]] for almost 75 years, and is still the highest [[prime]] number discovered without the aid of a computer.
  2 KB (296 words) - 01:09, 15 January 2024

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