Search results

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

• Real number
  ...either a [[rational number]] or an [[irrational number]]. The set of real numbers is denoted by <math>\mathbb{R}</math>. ...math> can be constructed from <math>\mathbb{Q}</math>, the set of rational numbers using Dedekind cuts.
  390 bytes (57 words) - 15:00, 26 March 2023
• Rational number
  ...denominator''') is an integer different from zero. The set of all rational numbers is named <math>\mathbb{Q}</math>. ...h>a/b</math> is called '''fraction'''. A fraction is irreducible when both numbers are [[coprime]], otherwise it can be reduced to an irreducible form by divi
  3 KB (541 words) - 15:01, 26 March 2023
• Irrational number
  ...o mathematician takes that to be a definition. Some examples of irrational numbers are <math>\sqrt{2}</math> or <math>e</math>.
  763 bytes (124 words) - 15:14, 26 March 2023
• Binary
  ...ernary, quaternary, and so on. Binary numeral system, a representation for numbers using only two [[digit]]s (usually, 0 and 1). Thus it is a [[base]] 2 numbe ...This makes them [[repunit]] numbers. This innate 'binariness' of Mersenne numbers makes calculations in the search for [[Mersenne prime]]s a bit easier.
  1 KB (210 words) - 11:16, 22 January 2019
• Repunit
  ...t ('''rep'''eated '''unit''', "1" being the number referred to as "unity") numbers. 111 is a repunit, in base 2 it is equal to 7 (base 10), in base 3 it is eq Repunit numbers are of the form:
  1 KB (207 words) - 08:04, 12 March 2024
• Parallel computing
  ...ld all be done in parallel. This would cut a 5 step procedure to 3. If the numbers were each 100 digits long and 10 individuals (or cores in a computer) worke
  3 KB (416 words) - 06:47, 1 May 2019
• Long multiplication
  If a positional numeral system is used, a natural way of multiplying numbers is taught in schools as '''long multiplication''', sometimes called '''grad ...in base 2. [[Prime95]] does not use this form of multiplication for large numbers, using [[Fast Fourier transform|FFT]]'s is much faster. A person doing long
  2 KB (165 words) - 17:01, 29 August 2022
• Trial factoring
  The simplest approach is to already have available a supply of small prime numbers to use as trial divisors. If P(i) is the i'th prime number so P(1) = 2, P(2 ...e [[Sieve of Eratosthenes]], itself requiring a small table of known prime numbers to start its process, such as 2 and 3.
  7 KB (1,221 words) - 13:20, 11 February 2019
• Natural number
  ...er to physical objects. A farmer counting his sheep would only use natural numbers.
  316 bytes (43 words) - 15:00, 26 March 2023
• Richard Crandall
  ...ade available for purchase posters of the largest known [[Mersenne prime]] numbers. Posters of [[M38]], [[M39]], [[M40]], [[M41]], [[M42]], [[M43]], [[M44]], *with [[Carl Pomerance]]: ''Prime numbers: A Computational Perspective.'' Springer 2001.
  3 KB (431 words) - 11:36, 14 January 2024
• Irrational base discrete weighted transform
  ...f ''Rapid multiplication modulo the sum and difference of highly composite numbers.''] Math. Comp. 72:387-395, 2003. ...[http://thales.doa.fmph.uniba.sk/macaj/skola/teoriapoli/primes.pdf ''Prime numbers: A Computational Perspective: 2nd edition'']. Springer, 2005.
  1 KB (172 words) - 18:49, 28 September 2023
• PrimeKit
  ...matica implementations of all 112 algorithms discussed in the book ''Prime Numbers: A Computational Perspective'' (2001) by [[Richard Crandall]] and Carl Pome
  1 KB (125 words) - 09:38, 23 January 2019
• Coprime
  ...is 1 (<math>\gcd{(x,y)} = 1</math>). This does not mean that any of these numbers is prime. :Two random numbers are coprime with a probability over 60% (the exact number is <math>6/\pi^2<
  738 bytes (112 words) - 09:50, 23 January 2019
• Greatest common divisor
  The '''Greatest common divisor (gcd)''' of two numbers, commonly expressed by <math>gcd(a, b)</math>, where <math>a</math> and <ma ...e [[coprime]] or relatively prime. This does not mean that either of these numbers are prime.
  2 KB (339 words) - 18:38, 27 September 2023
• Modular arithmetic
  ...s;4 = 8 (because 5+5+5+5 = 8). This is arithmetic modulo 12 and the set of numbers representing the hours 0, 1, 2, 3,..., 11 is known as <b>Z</b>/12<b>Z</b>. ...We use the congruence symbol (<math>\equiv</math>) instead. Note that two numbers ''A'' and ''B'' are said to be congruent modulo ''n'' if ''A''-''B'' is a m
  4 KB (625 words) - 10:25, 23 January 2019
• Elliptic curve method
  ...icance of this to the Elliptic Curve Method is that a huge amount of other numbers will have factors in common with our highly composite number. ...bound]] B₁, we multiply the original point '''P''' by all prime numbers less than B₁ (each prime number is raised to a power such that t
  19 KB (3,181 words) - 22:27, 6 July 2023
• University of California, Los Angeles
  ...090 [[Classes of computers#Mainframe computers|mainframe]]. Each of these numbers had over 1200 digits.
  2 KB (347 words) - 14:54, 19 September 2021
• Raphael M. Robinson
  4 KB (526 words) - 14:51, 19 September 2021
• Gordon Spence
  ...'', my family (not in that order!!) and of course, searching for big prime numbers."
  686 bytes (96 words) - 00:10, 15 January 2024
• Wacław Sierpiński
  592 bytes (86 words) - 00:38, 15 January 2024

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