Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).
Navigation
Topics Help • Register • News • History • How to • Sequences statistics • Template prototypes

Search results

Jump to: navigation, search

Page title matches

Page text matches

  • ...positive [[natural number]]s (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. The set of all integers is u ...e operation of [[division]], since the quotient of two integers (''e.g.'', 1 divided by 2), need not be an integer.
    3 KB (404 words) - 14:58, 26 March 2023
  • :1 + 5 = 6
    333 bytes (43 words) - 16:55, 29 August 2022
  • ...ponent|exponentiation]] (<math>a^0=1</math>) and [[factorial number]]s (0!=1).
    2 KB (271 words) - 17:00, 29 August 2022
  • ...<math>a^p</math> means that we are notating the number <math>\large \frac{1}{a*a*a*a...}</math> where, you guess it, the [[absolute value]] of p repres ...th> equals the reciprocal (or the multiplicative inverse) of a, that means 1/a.
    1 KB (273 words) - 16:56, 29 August 2022
  • :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> for <math>n \ge 1</math>.
    729 bytes (93 words) - 13:40, 5 November 2023
  • ...is a [[prime]] number, and a number that has factors other than itself and 1 is called a [[composite number]].
    576 bytes (107 words) - 19:03, 5 February 2019
  • ...ive [[integer]] is '''composite''' if it is neither [[prime]] nor equal to 1. The smallest composite is 4. ...where the integers <math>a</math> and <math>b</math> are both greater than 1, the number is composite.
    358 bytes (56 words) - 23:30, 26 October 2020
  • **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-1
    1 KB (144 words) - 13:44, 24 January 2019
  • ...ion method|p-1]]: It finds a factor ''p'' if the largest prime factor of p-1 is small. *[[p+1 factorization method|p+1]]: Similar to p-1, but succeeds if p+1 has no large factors.
    4 KB (642 words) - 12:57, 5 March 2019
  • The official discovery date for 2<sup>{{Num|57885161}}</sup>-1 was 2013-01-25. See the [http://www.mersenne.org/primes/?press=M57885161 pr .../watch?v=QSEKzFGpCQs New Largest Known Prime Number 2<sup>57,885,161</sup>-1] at YouTube channel Numberphile
    2 KB (235 words) - 11:49, 18 February 2019
  • ...ormally refers to the 47th [[Mersenne prime]] 2<sup>{{Num|43112609}}</sup>-1, in order of size from the smallest to greatest. This is the primary usage On 2018-04-08 all tests below 2<sup>{{Num|43112609}}</sup>-1 were verified by [[GIMPS]], officially making it the 47th Mersenne prime.
    5 KB (694 words) - 13:17, 21 August 2019
  • ...ehmer test|LL]], PRP, [[Trial factoring|TF]], [[P-1 factorization method|P-1]], [[Elliptic curve method|ECM]]|release=1996|latest=30.3b6<br/><small>2020 {| style="font-size: 85%; text-align: center" border="1" style="border: 1px solid #afafaf; background-color: #f9f9f9; border-collap
    11 KB (1,586 words) - 12:24, 7 August 2021
  • When expressed in decimal notation, the odd numbers end in 1, 3, 5, 7 or 9. All prime numbers except 2 are odd.
    316 bytes (42 words) - 11:21, 7 March 2019
  • CUDALucas -cufftbench 1 22680 5 CUDALucas -threadbench 1 22680 5 10
    2 KB (275 words) - 11:11, 21 August 2019
  • ...used to refer to the 41st [[Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1. ...nce using half of a Bull NovaScale 5000 HPC running Linux on 16 Itanium II 1.3 GHz CPUs for five days using the [[Glucas]] program by Guillermo Balleste
    1 KB (203 words) - 11:26, 18 February 2019
  • ...used to refer to the 43rd [[Mersenne prime]] 2<sup>{{Num|30402457}}</sup>-1. *by Tony Reix of Bull S.A. in Grenoble, France, in 5 days using 16 Itanium2 1.5 GHz [[CPU]]s of a Bull NovaScale 6160 HPC at Bull Grenoble Research Cente
    1 KB (191 words) - 11:31, 18 February 2019
  • ...used to refer to the 46th [[Mersenne prime]] 2<sup>{{Num|42643801}}</sup>-1.
    2 KB (248 words) - 11:45, 18 February 2019
  • 1
    935 bytes (70 words) - 18:56, 10 December 2022
  • 1;T:S
    490 bytes (35 words) - 12:22, 11 December 2022
  • ...uction takes a very small time to happen. Many CPUs today can do more than 1 billion instructions in a single second. In general, the more a CPU can do
    2 KB (366 words) - 09:57, 13 February 2019

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