Search results

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

• Sierpiński number
  These numbers are named after [[Wacław Sierpiński]].
  324 bytes (48 words) - 13:37, 8 April 2023
• Sierpiński problem
  Consider numbers of the form {{V|N}} = {{Kbn|+|k|n}}, where {{Vk}} is odd and {{Vn}} > 0. If ...ence {{Kbn|+|78557|n}} can be prime. The same arguments can be said of the numbers 271129, 271577, 322523, 327739, 482719, 575041, 603713, 903983, 934909, 965
  5 KB (650 words) - 10:25, 26 March 2024
• Covering set
  ...'''covering set''' for a sequence of integers refers to a set of [[prime]] numbers such that every term in the sequence is divisible by at least one member of *[[Riesel_2_Riesel|Riesel numbers]]
  380 bytes (56 words) - 10:27, 26 March 2024
• Seventeen or Bust
  ...P takes so much computational power, we try to eliminate as many non-prime numbers as possible from the queue by [[sieving]], which means to take a (relativel As of April 2010, Seventeen Or Bust has discovered eleven huge prime numbers. The four largest discoveries ranks as the tenth to thirteenth largest prim
  3 KB (544 words) - 16:44, 21 July 2019
• Perfect number
  ...= 6. The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. The next perfect numbers are 496 and 8128. These first four perfect numbers were the only ones known to the ancient Greeks.
  6 KB (885 words) - 11:33, 7 March 2019
• Residue
  ...dues (meaning they both missed a prime) out of a pool of ~ 18.4 pentillion numbers, this is considered to be impossible.
  1 KB (235 words) - 10:24, 6 February 2019
• GIMPS clients
  ...mbers in a time that any human being would want to wait for. That is, once numbers get really big, it is worthwhile to set up the multiplication using FFTs an ...S]], the [[distributed computing]] project researching [[Mersenne prime]]s numbers, uses. It is entirely [[Wikipedia:Computer console|console]]-based, with no
  8 KB (1,218 words) - 15:37, 13 August 2020
• Mfaktc
  ...1 was released, this version added support for trial factoring on Wagstaff numbers.
  5 KB (765 words) - 14:54, 25 February 2019
• Riesel number
  *{{Num|15000}} Riesel numbers in the {{OEIS|l|A101036}} *[[Riesel 2 Riesel|Riesel numbers]]
  827 bytes (112 words) - 08:21, 25 March 2024
• M12
  ...[[bit level]] over 169.4. The current version of [[Prime95]] cannot handle numbers this large, nor can [[mfaktc]].
  2 KB (354 words) - 14:52, 19 September 2021
• Primality test
  ==Primality tests for numbers {{V|N}} with special form== *[[Pépin's test]]: Used to test primality in Fermat numbers.
  3 KB (501 words) - 05:20, 3 August 2021
• Square root
  ...the principle square root and the negative square root. For negative real numbers, the concept of [[imaginary number|imaginary]] and [[complex number]]s has ...roots of positive [[integer]]s are often ''[[irrational number]]s'', i.e., numbers not expressible as a [[quotient]] of two integers. For example, <math>\sqrt
  13 KB (1,873 words) - 16:52, 24 October 2020
• Primality testing program
  ! Program !! Numbers tested !! Hardware !! OS !! Link | k &times; bⁿ±c general numbers
  2 KB (314 words) - 21:23, 29 August 2019
• Pépin's test
  ...f [[Fermat number]]s, but it is of no help for finding the factors of such numbers. Pépin's test can also be used for proving the primality of other numbers, like the [[Generalized Fermat number]]s <math>F_{n,2} = 4^{3^n}+2^{3^n}+1<
  2 KB (401 words) - 14:40, 6 March 2019
• Proof by induction
  ...mathematical theorems that takes advantage of the structure of the natural numbers as described by the [[Peano postulates]]. Proof by induction is normally pe
  4 KB (679 words) - 13:57, 20 February 2019
• Mprime (Cray)
  ...used [[Fast Fourier transform]]s for the [[multiplication]] of very large numbers. This represented an advance over the software used by [[Landon Curt Noll]]
  639 bytes (92 words) - 12:02, 7 February 2019
• Probable prime
  ...eger]] that satisfies a specific condition also satisfied by all [[prime]] numbers.}} ...eger]] that satisfies a specific condition also satisfied by all [[prime]] numbers. Different types of probable primes have different specific conditions. Whi
  2 KB (232 words) - 07:28, 12 March 2024
• Pseudoprime
  ...acticably slow; however probabilistic primality tests can rapidly generate numbers which are "[[Probable prime|probably prime]]". The term "probably" is not t
  1 KB (155 words) - 20:32, 25 July 2020
• Pentium
  ...into and out of the [[CPU]] is a major consideration for processing large numbers.
  2 KB (285 words) - 00:50, 30 January 2019
• Floating-point unit
  ...ally designed to carry out operations on [[floating-point|floating point]] numbers. Typical operations are [[addition]], [[subtraction]], [[multiplication]],
  2 KB (323 words) - 06:49, 1 May 2019

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