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

  • ...r ''Zahlen'' (German for "numbers"). They are also known as the '''[[whole number]]s''', although that term is also used to refer only to the positive intege [[Category:Number systems]]
    3 KB (404 words) - 14:58, 26 March 2023
  • '''Mathematics''' is the science of space, number and quantity. ...theorem: If you subtract an odd number from an even number you get an odd number.
    1 KB (186 words) - 17:00, 5 February 2019
  • '''Multiplication''' is the process of calculating the result when a number a is [[Addition|added]] to itself b times. The result of a multiplication i ...es are in [[exponent|exponentiation]] (<math>a^0=1</math>) and [[factorial number]]s (0!=1).
    2 KB (271 words) - 17:00, 29 August 2022
  • ...wer a base number is raised to, the exponent is the superscript value of a number written as <math>a^p</math>. ...duct]] a &times; a &times; a &times; a is written as <math>a^4</math>, the number 4 is the index, or exponent.
    1 KB (273 words) - 16:56, 29 August 2022
  • ...or bang) after a number, it represents multiplying a number by all [[whole number|whole numbers]] smaller than it. *[[Multifactorial number]]
    729 bytes (93 words) - 13:40, 5 November 2023
  • A '''factor''' is one of the numbers or expressions that make up another number by [[multiplication]]. Let a and b be integers. Then a divides b (which may ...a number that has factors other than itself and 1 is called a [[composite number]].
    576 bytes (107 words) - 19:03, 5 February 2019
  • ...he integers <math>a</math> and <math>b</math> are both greater than 1, the number is composite. *[[Wikipedia:Composite number|Wikipedia]]
    358 bytes (56 words) - 23:30, 26 October 2020
  • If the minuend is less than the subtrahend, the difference will be a negative number. For example, 17 &minus; 25 = ( &minus;8 ). We can say this as, "Seventeen
    893 bytes (128 words) - 16:58, 29 August 2022
  • **Near Cunningham number **Near-repdigit
    1 KB (144 words) - 13:44, 24 January 2019
  • ...ality tests|primality test]], we have to attempt the factorization of this number. The same can be said of the other factor ''b''. So it can be seen that we ..."special purpose" methods whose execution time depends on the size (i.e., number of digits), or on other particular properties of the factors.
    4 KB (642 words) - 12:57, 5 March 2019
  • ...substantial award for the person that discovers a ten million digit prime number. ...00}}''' to the first individual or group who discovers a [[Megaprime|prime number with at least '''{{Num|1000000}} decimal digits''']] (awarded 2000-04-06)
    2 KB (321 words) - 18:50, 14 December 2023
  • '''Number theory''' is a branch of pure [[mathematics]] devoted primarily to the stud
    202 bytes (29 words) - 12:55, 20 January 2019
  • ...st]]s of prime-exponent [[Mersenne number]]s, and Pépin tests of [[Fermat number]]s. It is written by [[Ernst Mayer]] using C programming language and [[ARM
    1 KB (198 words) - 07:28, 22 August 2019
  • | number=581887266232...071724285951 To confirm that there were no errors in the [[hardware]] or [[software]], the number had to be independently verified by running tests on various machines with
    2 KB (235 words) - 11:49, 18 February 2019
  • | number=316470269330...166697152511 ...er possible usages refer to the [[Nomenclature and notation]] article. The number now refered to as M47 was actually the 45th Mersenne prime found. [[M45]],
    5 KB (694 words) - 13:17, 21 August 2019
  • ...Awards]). As such, a user who uses Prime95 to discover a qualifying prime number would not be able to claim the prize directly. A free software package woul ...page4.html Web Archive]). This is slightly shorter than a 24 million digit number. Newer versions of Prime95 (version 25, 26 and 27) can handle Mersenne numb
    11 KB (1,586 words) - 12:24, 7 August 2021
  • ...ber of objects can be placed into exactly 2 groups that have the identical number of objects. *[[Odd number]]
    425 bytes (61 words) - 11:19, 7 March 2019
  • An '''odd number''' is any [[integer]] that is not divisible by 2. *[[Even number]]
    316 bytes (42 words) - 11:21, 7 March 2019
  • ...UDA]]-based program written by [[Shoichiro Yamada]] for testing [[Mersenne number]]s for primality with [[Lucas-Lehmer test]].
    2 KB (275 words) - 11:11, 21 August 2019
  • ...a program to perform the [[Lucas-Lehmer test]] for primality on [[Mersenne number]]s. It is related to [[GIMPS]] effort to search the largest primes ever fou
    3 KB (426 words) - 14:21, 14 February 2019

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