Search results

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

• M18
  | number=259117086013...362909315071 '''M18''' is the 18th known [[Mersenne prime]] 2^{{Num|3217}}-1 found on 1957-09-08 by [[Hans Riesel]].
  415 bytes (47 words) - 22:26, 17 February 2019
• M11
  | number=162259276829...578010288127 '''M11''' is the 11th known [[Mersenne prime]] 2¹⁰⁷-1</math> found in 1914 by [[Ralph Ernest Powers]].
  412 bytes (47 words) - 14:23, 17 February 2019
• M10
  | number=618970019642...137449562111 '''M10''' is the 10th known [[Mersenne prime]] <math>2^{89}-1</math> found in 1911 by [[Ralph Ernest Powers]].
  403 bytes (44 words) - 13:54, 17 February 2019
• Proth prime
  A '''Proth prime''' is not a true class of numbers, but primes in the form {{Kbn|+|k|n}} wit *[[Proth prime table|Table]] with all available ''k''-values
  656 bytes (91 words) - 07:02, 31 August 2020
• Riesel prime
  Although there's no official definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2^{{Vn}} > {{Vk *IDs and found dates from the [[The Prime Pages]]
  2 KB (280 words) - 00:37, 25 May 2024
• M26
  | number=402874115778...523779264511 '''M26''' is the 26th known [[Mersenne prime]] 2^{{{Num|23209}}}-1 found on 1979-02-09 by [[Landon Curt Noll]].
  455 bytes (52 words) - 23:01, 17 February 2019
• Introductory stuff
  It is feasible, but unlikely. A [[positive claim]], that of a new [[Mersenne prime]], is subject to [[Double check|double]] and [[triple check]]s by others, i ==What is a Mersenne prime?==
  14 KB (2,370 words) - 15:15, 17 August 2019
• What use are prime numbers anyway?
  ...Wikipedia:G. H. Hardy|Godfrey H. Hardy]] (1877 - 1947) said of his work in number theory :"Here is one science (number theory) at any rate whose very remoteness from ordinary human activities sh
  3 KB (497 words) - 07:17, 22 May 2020
• Pocklington's theorem
  ...vented by H. C. Pocklington in 1914, which is a [[primality test]] for the number ''N'', states: ...v\,1\,\pmod{n}</math> and <math>gcd(a^{(N-1)/q}-1,N) = 1</math>, then each prime factor ''q'' of ''N'' has the form <math>q^kr+1</math>.
  2 KB (346 words) - 19:51, 30 August 2019
• Multiple polynomial quadratic sieve
  Let <math>N</math> be the number to be factored. This number must not be a perfect power. If somehow we find two integers <math>X</math> ...^2 \equiv u\,\pmod N</math> where <math>u</math> is the product of small [[prime]] numbers. The set of these primes is the ''factor base''. These relations
  6 KB (1,068 words) - 14:33, 13 February 2019
• Proth number
  In [[number theory]], a '''Proth number''' is a number of the form A [[Proth prime]] is a Proth number, which is prime.
  670 bytes (104 words) - 10:59, 9 July 2021
• 27121 Search
  ...[[PrimeGrid]], is a [[Distributed computing]] project, which searches for prime numbers of the form: 27 &times; 2ⁿ ± 1 and 121 &times; 2<sup>n< ...tion system, which makes it easy to use [[PRPclient]] to reserve a testing number directly from [http://prpnet.primegrid.com:12006/ the website].
  983 bytes (138 words) - 13:25, 8 February 2019
• 12121 Search
  ...121 Search''' is a [[Distributed computing]] project, which searches for [[prime]]s of the form: 121 &times; 2ⁿ-1, it also searches for primes of ...tion system, which makes it easy to use [[PRPclient]] to reserve a testing number directly from [http://prpnet.primegrid.com:12001/ the website].
  984 bytes (143 words) - 13:30, 8 February 2019
• Assignments
  ...int files, results.txt file and the prime.spl, if it exists. Be aware that prime.spl is written to while an exponent is in progress and not just after compl ...ly large quantity of exponents, add this line to your [[GIMPS client files|prime.ini]] file:
  20 KB (3,473 words) - 18:42, 14 December 2023
• GIMPS type of work
  ==Factoring of a prime number (exponent) candidate== ...this when [[mfaktc]]/[[mfakto]] are used. There is no chance of finding a prime through factoring.
  4 KB (757 words) - 15:17, 25 July 2020
• GIMPS networking, PrimeNet and communication
  prime.ini prime.spl
  8 KB (1,269 words) - 10:09, 7 March 2019
• 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
• Worktodo.txt
  :AdvancedTest simply [[Lucas-Lehmer test|LL]] tests the given [[Mersenne number]], (ignoring any sort of prefactoring) and is used by [[Prime95]] when you ;Probable prime
  2 KB (273 words) - 22:58, 11 May 2019
• Assignment ID
  ...ponent) PrimeNet will issue a 32 character hexadecimal assignment ID. This number appears to be random (at least in part), so an individual cannot construct [[Category:Great Internet Mersenne Prime Search]]
  837 bytes (127 words) - 08:43, 15 May 2024
• Triple check
  ...composite]], (this assumes that the residue is not zero, otherwise it is [[prime]]). ...ainst some error in either software or hardware design or manufacture, the number will be tested using [[Mlucas]] or [[Glucas]] on a computer using an Itaniu
  1 KB (181 words) - 14:37, 11 February 2019

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