Search results

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

• 79.3 million
  ...assignment/testing to a maximum of ~'''79.3 million'''. This seemingly odd number is derived from the fact that it is the largest to practically test using a [[Category:Great Internet Mersenne Prime Search]]
  1 KB (164 words) - 18:40, 14 December 2023
• Strong law of small numbers
  ...s after [[M12]] was proven prime). Many believe that the [[Double Mersenne number#Catalan Sequence|Catalan Sequence]] is also a case of this law, since only Because relatively few [[Mersenne prime]]s are known, people often conjecture about patterns.
  1 KB (197 words) - 15:02, 11 February 2019
• P+1 factorization method
  If we define <math>D = u^2 - 4</math>, then for any odd prime <math>p</math>, <math>p</math> divides both gcd(<math>N</math>, <math>U_M</ ...nt of p-1. So when the [[greatest common divisor|gcd]] does not reveal the prime factor of <math>N</math> we retry with a different value of <math>u</math>
  8 KB (1,536 words) - 11:35, 12 February 2019
• Woodall number
  In [[number theory]], a '''Woodall number''' W_n is any [[natural number]] of the form for some natural number ''n''.
  374 bytes (59 words) - 16:41, 31 August 2021
• Gerbicz error checking
  ...ts]], the technique is used to ensure validity of PRP tests for [[Mersenne number]]s: ...e programs and [[PRST]] in an extended version for PRP tests on additional number forms.
  3 KB (528 words) - 14:59, 3 October 2023
• ECPP-DJ
  ...aic%20number%20theory%20-%20Cohen.pdf "A Course in Computational Algebraic Number Theory"] (1993). The ECM factoring and manipulation was heavily inspired by :PRIME
  2 KB (237 words) - 18:04, 2 December 2019
• M19
  | number=190797007524...815350484991 [[Category:Mersenne prime]]
  280 bytes (23 words) - 22:31, 17 February 2019
• M20
  | number=285542542228...902608580607 [[Category:Mersenne prime]]
  280 bytes (23 words) - 22:33, 17 February 2019
• M21
  | number=478220278805...826225754111 [[Category:Mersenne prime]]
  281 bytes (25 words) - 22:35, 17 February 2019
• M22
  | number=346088282490...883789463551 [[Category:Mersenne prime]]
  281 bytes (25 words) - 22:37, 17 February 2019
• M23
  | number=281411201369...087696392191 [[Category:Mersenne prime]]
  282 bytes (25 words) - 22:38, 17 February 2019
• M24
  | number=431542479738...030968041471 [[Category:Mersenne prime]]
  283 bytes (24 words) - 22:48, 17 February 2019
• M8
  | number=2147483647 [[Category:Mersenne prime|M08]]
  229 bytes (20 words) - 13:50, 17 February 2019
• M7
  | number=524287 [[Category:Mersenne prime|M07]]
  215 bytes (19 words) - 13:48, 17 February 2019
• M6
  | number=131071 [[Category:Mersenne prime|M06]]
  215 bytes (19 words) - 13:48, 17 February 2019
• GIMPS PrimeNet reports
  ...1000 most recently 'cleared' exponents (those determined to be [[composite number]]s). A new list is generate each hour at the start of the hour. This list a ...of 2008. Provides a "classic" summary of the search status for [[Mersenne number]]s with exponents below [[79.3 million]] broken down by [[Fast Fourier tran
  7 KB (1,137 words) - 15:30, 13 August 2020
• 15k Search
  The first goal is, to spend as little CPU time as possible, per [[titanic prime]] found. The second goal is, to find a [[prime]] in a secure manner, worthy of an [[EFF prizes|E.F.F. prize]].
  3 KB (517 words) - 14:51, 15 February 2019
• M27
  | number=854509824303...961011228671 [[Category:Mersenne prime]]
  302 bytes (26 words) - 08:16, 18 February 2019
• M28
  | number=536927995502...709433438207 [[Category:Mersenne prime]]
  278 bytes (23 words) - 08:22, 18 February 2019
• M29
  | number=521928313341...083465515007 [[Category:Mersenne prime]]
  296 bytes (26 words) - 08:25, 18 February 2019

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