Search results

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

• 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) - 05:23, 7 June 2024
• 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

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