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

Page title matches

  • ...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

  • * Prime (direct) ** Mersenne_prime|Mersenne prime
    929 bytes (99 words) - 17:14, 5 April 2024
  • 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
  • "en": "Short data for a prime number sequence",
    1 KB (137 words) - 18:49, 13 December 2018
  • :<nowiki>{{GP|<prime name>|<Parameter>}}</nowiki> *<nowiki>{{GP|Carol-Kynea prime 2|CKBase}}</nowiki> results in
    3 KB (311 words) - 18:08, 13 August 2021
  • ...n}}-value;Top5000-ID}}: the {{Vn}}-value is given with a link to the [[The Prime Pages]] ::T: [[Twin prime]]
    3 KB (440 words) - 16:51, 22 March 2024
  • This template will show the currently greatest [[Mersenne prime]] found. <pre>{{Greatest Mersenne Prime|<parameter>}}</pre>
    2 KB (264 words) - 16:55, 7 April 2019
  • ...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
  • *'''#''': 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
  • ...}. On the other hand, 15 = 16 &minus; 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
  • 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
  • ...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
  • ...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
  • 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
  • | 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
  • | 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
  • ...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
  • A '''Titanic prime''' is a [[prime]] number whose decimal representation has {{Num|1000}} or more digits. The smallest titanic prime is {{T5000|58901|10<sup>999</sup>+7}}.
    394 bytes (48 words) - 11:40, 2 July 2020
  • A '''gigantic prime''' is a [[prime]] number whose decimal representation has at least {{Num|10000}} [[digit]]s. The smallest gigantic prime is 10<sup>{{Num|9999}}</sup>+{{Num|33603}}.
    515 bytes (67 words) - 13:38, 6 March 2019
  • 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
  • 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

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