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

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<sup>999</sup>+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<sup>{{Num|9999}}</sup>+{{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
  • Edson Smith
    .... In August 2008, one of these computers found a [[M47| World record prime number.]] Since the first [[Mersenne prime]] found by a computer ([[M13]]) was found at UCLA (as were 6 others in the
    4 KB (564 words) - 00:11, 15 January 2024
  • Mathematics
    '''Mathematics''' is the science of space, number and quantity. ...theorem: If you subtract an odd number from an even number you get an odd number.
    1 KB (186 words) - 17:00, 5 February 2019
  • Factorial number
    ...or bang) after a number, it represents multiplying a number by all [[whole number|whole numbers]] smaller than it. *[[Factorial prime]]
    729 bytes (93 words) - 13:40, 5 November 2023
  • Factor
    A '''factor''' is one of the numbers or expressions that make up another number by [[multiplication]]. Let a and b be integers. Then a divides b (which may ...a number that has factors other than itself and 1 is called a [[composite number]].
    576 bytes (107 words) - 19:03, 5 February 2019
  • Composite number
    A positive [[integer]] is '''composite''' if it is neither [[prime]] nor equal to 1. The smallest composite is 4. ...he integers <math>a</math> and <math>b</math> are both greater than 1, the number is composite.
    358 bytes (56 words) - 23:30, 26 October 2020
  • Factoring Database
    **[[Home prime]]s of various bases **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-1
    1 KB (144 words) - 13:44, 24 January 2019
  • Factorization
    '''Factorization''' is the process of finding [[prime]] [[factor]]s. This article will only cover integer factorization. ...t can be seen that we have to proceed recursively in order to find all the prime factors of ''c''.
    4 KB (642 words) - 12:57, 5 March 2019
  • EFF prizes
    ...substantial award for the person that discovers a ten million digit prime number. If you find such a prime with the software provided, GIMPS will claim the award and distribute the a
    2 KB (321 words) - 18:50, 14 December 2023
  • Mlucas
    ...st]]s of prime-exponent [[Mersenne number]]s, and Pépin tests of [[Fermat number]]s. It is written by [[Ernst Mayer]] using C programming language and [[ARM ...es not impose prize-sharing rules, should a user be lucky as to find a new prime eligible for the monetary prize offered by the [[Electronic Frontier Founda
    1 KB (198 words) - 07:28, 22 August 2019
  • M48
    | number=581887266232...071724285951 '''M48''' normally refers to the 48th [[Mersenne prime]], in order of size from the smallest to greatest. This is the primary usag
    2 KB (235 words) - 11:49, 18 February 2019
  • M47
    | number=316470269330...166697152511 ...] article. The number now refered to as M47 was actually the 45th Mersenne prime found. [[M45]], [[M46]], and M47 were discovered in the order of M47, M45 (
    5 KB (694 words) - 13:17, 21 August 2019
  • Prime95
    ...], a [[distributed computing]] project dedicated to finding new [[Mersenne prime]] numbers. More specifically, Prime95 refers to the Windows and Mac OS X ve ...Awards]). As such, a user who uses Prime95 to discover a qualifying prime number would not be able to claim the prize directly. A free software package woul
    11 KB (1,586 words) - 12:24, 7 August 2021
  • Odd number
    An '''odd number''' is any [[integer]] that is not divisible by 2. ...expressed in decimal notation, the odd numbers end in 1, 3, 5, 7 or 9. All prime numbers except 2 are odd.
    316 bytes (42 words) - 11:21, 7 March 2019
  • M41
    | number=299410429404...882733969407 '''M41''' is the short hand used to refer to the 41st [[Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1.
    1 KB (203 words) - 11:26, 18 February 2019
  • M43
    | number=315416475618...411652943871 '''M43''' is the short hand used to refer to the 43rd [[Mersenne prime]] 2<sup>{{Num|30402457}}</sup>-1.
    1 KB (191 words) - 11:31, 18 February 2019
  • M46
    | number=169873516452...765562314751 '''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>{{Num|42643801}}</sup>-1.
    2 KB (248 words) - 11:45, 18 February 2019
  • Distributed computing
    There are a number of individuals or groups in the fields of science, mathematics, cryptograph ...ernet, to look for extra-terrestrial radio signals, to look for [[Mersenne prime]]s so large that they have more than [[ten million digits]], to find more e
    4 KB (674 words) - 12:11, 19 February 2019
  • M42
    | number=122164630061...280577077247 '''M42''' refers to the 42nd [[Mersenne prime]] 2<sup>{{Num|25964951}}</sup>-1.
    934 bytes (118 words) - 11:26, 18 February 2019
  • M1
    | number= 3 [[Category:Mersenne prime|M01]]
    193 bytes (19 words) - 13:43, 17 February 2019
  • Conjectures 'R Us
    ...project]] in search for lowest [[Sierpiński number|Sierpiński]]/[[Riesel number|Riesel]] values.}} ...mbination of algebraic and trivial factor(s), or make [[Generalized Fermat number]]'s.
    3 KB (503 words) - 02:20, 1 May 2024
  • Fast Fourier transform
    Let ''x''<sub>0</sub>, ...., ''x''<sub>''n''-1</sub> be [[complex number]]s. The DFT is defined by the formula ...lar misconception) there are O(''n'' log ''n'') FFTs for all ''n'', even [[prime]] ''n''.
    17 KB (2,684 words) - 18:50, 28 September 2023
  • GpuLucas
    ...[[CUDA]]-based program written by [[Andrew Thall]] for testing [[Mersenne number]]s for primality. ...l, A. [http://andrewthall.org/papers/gpuMersenne2011MKII.pdf Fast Mersenne Prime Testing on the GPU] (2011)
    2 KB (239 words) - 11:12, 13 February 2019
  • GpuOwL
    {{InfoboxProgram|workload=[[Lucas-Lehmer test|LL]], [[Probable prime|PRP]]|title=gpuOwL|release=2017|latest=7.2<br>2020-11-01}} ...s a [[OpenCL]]-based program written by Mihai Preda for testing [[Mersenne number]]s for primality.
    1 KB (216 words) - 05:22, 1 December 2020
  • MersenneForum
    ...upport [[GIMPS]], the broader community of [[Mersenne number]]s, [[prime]] number, and factoring projects. In addition to being the de facto help and support ==Prime number software discussion and development==
    2 KB (293 words) - 17:33, 5 July 2019
  • Primo
    '''Primo''' is a computer program which tests numbers for [[prime|primality]] using the [[Elliptic Curve Primality Proving]] (ECPP) [[algorit ...ot require a number to be of any specific form. If a number is found to be prime, a [[primality certificate]] is produced, which can be quickly verified.
    1 KB (191 words) - 20:33, 12 May 2020
  • M32
    | number=174135906820...328544677887 The '''32nd [[Mersenne prime]]''', both in size (smallest to largest) and in order of discover.
    2 KB (279 words) - 08:35, 18 February 2019
  • M33
    | number=129498125604...243500142591 '''M33''' refers to 33rd [[Mersenne prime]] number 2<sup>{{Num|859433}}</sup>-1.
    814 bytes (97 words) - 08:38, 18 February 2019
  • M34
    | number=412245773621...976089366527 ...ber {{Num|378632}} [[decimal]] [[digit]]s long. The number was found to be prime in 1996.
    3 KB (513 words) - 08:42, 18 February 2019
  • Rational number
    A '''rational number''' is a [[real number]] which can be written as <math>\frac{a}{b}</math> or <math>a/b</math> wher ...r [[greatest common divisor]]. This operation does not change the rational number represented by the fraction.
    3 KB (541 words) - 15:01, 26 March 2023
  • Binary
    ...iness' of Mersenne numbers makes calculations in the search for [[Mersenne prime]]s a bit easier.
    1 KB (210 words) - 11:16, 22 January 2019

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

Retrieved from "https://www.rieselprime.de/ziki/Special:Search"