Search results

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

• Floating-point
  ...m for representing [[real number]]s which supports a wide range of values. Numbers are in general represented approximately to a fixed number of [[Significan ...tion of the radix point), so when stored in the same space, floating-point numbers achieve their greater range at the expense of precision.
  2 KB (294 words) - 22:56, 3 February 2019
• Factor5
  ...ing]] of [[Mersenne number]]s. It is capable of trial factoring very large numbers, many billions of digits. ...mbers with a hexillion digits or larger. Because it can work on such large numbers, it is used for [[Operation Billion Digits]].
  1 KB (201 words) - 21:16, 25 January 2019
• Complex number
  When the second element equals zero the complex numbers behaves as real numbers. That's why the first element of the complex number is known as the ''real ...on and the definitions above we can deduce all basic operations on complex numbers:
  2 KB (280 words) - 14:59, 26 March 2023
• Luigi Morelli
  *[http://www.doublemersennes.org/ Double Mersenne numbers]
  1 KB (154 words) - 01:15, 15 January 2024
• Operation Billion Digits
  ...m.org] boards, has written a trial factoring program that can handle these numbers. It's a sub-project of [[Lone Mersenne Hunters]].
  6 KB (918 words) - 16:28, 24 July 2020
• GIMPS factoring and sieving
  ...sieve. For example, if the sieving process eliminates 95% of the composite numbers, it may make more sense to test the remaining 5% along with any prime poten ===Constraints on prime factors of Mersenne numbers===
  6 KB (962 words) - 10:08, 7 March 2019
• Non-negative
  ...n-negative reals are all the [[real number]]s from zero upwards. All whole numbers are non-negative.
  421 bytes (66 words) - 22:51, 26 January 2019
• Ten million digits
  ...[[decimal]] [[digit]]s) in June of 1999, the next [[EFF prizes]] for prime numbers was '''ten million decimal digits'''. [[Prime95]] had an optional [[worktype]] to test numbers that were at least {{Num|10000000}} digits added (exponents of {{Num|332192
  979 bytes (146 words) - 14:23, 6 March 2019
• LLR
  ...Primality testing program|program]] available to perform primality test on numbers of the form {{Vk}}•2^{{Vn}}±{{V|c}}. *the fastest algorithms are for base two numbers (with {{Vk}} < 2^{{Vn}}):
  2 KB (300 words) - 22:00, 16 December 2023
• Mmff
  355 bytes (45 words) - 00:00, 27 January 2019
• Double Mersenne number
  ...seeable future. Efforts are under way attempting to find factors for these numbers. Currently MM(61) and MM(127) are getting the most attention. ...e Mersennes. [[Luigi Morelli]] is co-ordinating the effort to factor these numbers.
  4 KB (655 words) - 14:50, 19 September 2021
• P-1 factorization method
  ...so that <math>2^{E_2}</math> is about B1 and the same for the other prime numbers. ''B'' is the greatest prime number less than or equal to B1. Most of the composite numbers have a prime factor much greater than the other prime factors. Suppose that
  5 KB (814 words) - 01:35, 12 March 2019
• Self-initializing quadratic sieve
  ...ath>t^2 \equiv u\,\pmod N</math> where u is the product of small [[prime]] numbers. The set of these primes is the ''factor base''. These relations will be fo ...ecause the logarithms are rounded and we do not sieve with powers of prime numbers), perform a trial division of <math>g_{a,b}(x)/a</math> by the elements of
  10 KB (1,763 words) - 02:56, 12 March 2019
• Special number field sieve
  ...T]] (a volunteer [[distributed computing]] effort) and others to factorise numbers of the [[Cunningham project]].
  1 KB (186 words) - 12:07, 19 February 2019
• Lone Mersenne Hunters
  1 KB (213 words) - 09:58, 7 March 2019
• Fermat pseudoprimality test
  ...mbers, known as Carmichael numbers, for which the result is 1 whenever the numbers ''a'' and ''N'' are [[coprime]]. The smallest Carmichael number is 561. ...utational complexity, and which does not have the equivalent of Carmichael numbers.
  1 KB (164 words) - 10:56, 6 February 2019
• Miller-Rabin pseudoprimality test
  The '''Miller-Rabin pseudoprimality test''' is based in two facts for prime numbers:
  3 KB (432 words) - 15:33, 28 January 2019
• Generalized Fermat number
  John Cosgrave has studied the following numbers: Numbers of the form: <math>F_{n,r} = \sum_{i=0}^{p-1} \ 2^{i p^{n}} \ = \ 2^{(p-1)p
  5 KB (774 words) - 07:39, 27 May 2024
• PrimeGrid
  ...Grid''' is a [[distributed computing]] project for searching for [[prime]] numbers of world-record size. It makes use of the [[BOINC|Berkeley Open Infrastruct
  3 KB (458 words) - 10:28, 26 March 2024
• Worktype
  ...his is used to find factors. Currently this is only being assigned for low numbers that are known to be composite. *World record sized numbers to PRP test: Similar to World Record sized number to LL test, but uses the
  4 KB (603 words) - 02:31, 18 August 2019

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