Search results

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

• 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^{{{Num|24036583}}}-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^{{{Num|30402457}}}-1.
  1 KB (191 words) - 11:31, 18 February 2019

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