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

  • ==Base 2== HP<sub>2</sub>(10):
    980 bytes (143 words) - 13:22, 6 March 2019
  • ==Search for Home Primes base 2== {{HP|2|2295|281|189|2013-07-23|}}
    2 KB (175 words) - 18:45, 14 December 2023
  • *[[2 Minus Tables]] *[[2 Plus Tables]]
    614 bytes (69 words) - 12:08, 13 February 2019
  • ...zation]] of numbers of the form <math>b^n\pm 1</math> for <math>b</math> = 2, 3, 5, 6, 7, 10, 11, 12. The values of the exponent <math>n</math> are sele | 2 || 3 || 5 || 6 || 7 || 10 || 11 || 12
    7 KB (1,150 words) - 23:48, 19 April 2023
  • ==Factorizations Of Cunningham Numbers C<sup>-</sup>(2,n) = 2<sup>n</sup> - 1== * 001 - 100 : {{FDBCunningham|2|-|1|100}}
    2 KB (176 words) - 12:01, 13 February 2019
  • M25 is 2<sup>{{Num|21701}}</sup>-1, a number of {{Num|6533}} [[digit]]s. .... They were testing this theory and that Tuckerman's discovery of [[M24]] (2<sup>{{Num|19937}}</sup>-1) was the start of this island.
    2 KB (303 words) - 11:01, 26 February 2019
  • ...S<sub>0</sub>=4 and S<sub>n</sub> = (S<sub>n-1</sub>)<sup>2</sup> &minus; 2. In 1930, the American mathematician [[Derrick Henry Lehmer]] (1905 - 1991) ...hat 2<sup>5</sup> - 1 divides S<sub>3</sub> (37634 / 31 = 1214) shows that 2<sup>5</sup> - 1 is prime.
    20 KB (3,572 words) - 14:30, 17 February 2019
  • ...te the [[Lucas-Lehmer test]]. In 1876, Lucas proved the primality of <math>2^{127}{-}1</math> ([[M12]]) and this remained the highest [[Mersenne prime]]
    2 KB (296 words) - 01:09, 15 January 2024
  • ...at people use in most of the world. [[Computer]]s use '''binary''' or base 2. The length of a number (how many [[digit]]s it takes to write the number) ...us symbols (called [[digit]]s) for no more than ten distinct values (0, 1, 2, 3, 4, 5, 6, 7, 8 and 9) to represent any numbers, no matter how large. The
    1 KB (190 words) - 10:23, 18 January 2019
  • Different bases are often used in [[computer|computers]]. Binary (base 2) is used because at the most simple level, computers can only deal with 0s ! Decimal<br>base=10 !! Binary<br>base=2 !! Hexadecimal<br>base=16
    2 KB (399 words) - 10:37, 18 January 2019
  • *the nonnegative [[integer]]s (0, 1, 2, 3, ...) *the positive integers (1, 2, 3, ...) (often called [[natural number]]s)
    413 bytes (54 words) - 09:51, 8 February 2019
  • ...[natural number]]s (1, 2, 3, &hellip;), their negatives (&minus;1, &minus;2, &minus;3, ...) and the number zero. The set of all integers is usually den ...f [[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
  • ...s <math>a</math> and <math>b</math>, <math>(a + b) * (a - b)\,=\,a^2\,-\,b^2</math>.
    1 KB (186 words) - 17:00, 5 February 2019
  • In [[mathematics]]: to sum 2 numbers. It is normally symbolized by the plus sign '+'. :2 + 2 = 4
    333 bytes (43 words) - 16:55, 29 August 2022
  • ...largest available register is ''n'' bits wide the factors can only be ''n/2'' bits wide each.
    2 KB (271 words) - 17:00, 29 August 2022
  • :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> :5! = 5 * 4 * 3 * 2 * 1 = 120
    729 bytes (93 words) - 13:40, 5 November 2023
  • :<math>\frac 63 = 2</math> :<math>2 \times 3 = 6</math>.
    2 KB (368 words) - 16:58, 29 August 2022
  • ...ft over after dividing something. Dividing 13 into groups of 5 would yield 2 groups, with a remainder of 3.
    245 bytes (34 words) - 14:07, 18 January 2019
  • **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-1
    1 KB (144 words) - 13:44, 24 January 2019
  • ...composite numbers have small factors (half of the numbers are multiples of 2, a third are multiples of 3 and so on) it pays to run factorization methods
    4 KB (642 words) - 12:57, 5 March 2019

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