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

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

Page title matches

Page text matches

  • Williams prime
    ...a [[natural number]] of the form {{Kbn|(b-1)|b|n}} for integers ''b'' ≥ 2 and ''n'' ≥ 1. ...Smallest <ref>The list of smallest primes of any base is an ASCII file for 2 ≤ ''b'' ≤ 1024. For unknown values only the base is given.</ref> !! Rem
    5 KB (744 words) - 07:30, 5 August 2019
  • Carol-Kynea prime 2
    |CKBase=2 2
    5 KB (537 words) - 08:17, 9 October 2020
  • Carol-Kynea prime 6
    2 2
    1 KB (85 words) - 10:45, 16 April 2023
  • Srsieve
    '''srsieve''' (and '''sr1/2/5sieve''') is used to create sieve files for one or more sequences. Those s
    2 KB (265 words) - 07:36, 28 May 2021
  • Examples
    <pre><math>\sideset{_1^2}{_3^4}\prod_a^b</math></pre> :<math>\sideset{_1^2}{_3^4}\prod_a^b</math>
    11 KB (1,236 words) - 14:41, 3 September 2020
  • Great Internet Mersenne Prime Search
    ...as born in 1588. Mersenne investigated a particular type of prime numbers: 2<sup>p</sup> - 1, in which ''p'' is an ordinary [[prime]].
    3 KB (450 words) - 14:37, 21 August 2019
  • List of known Mersenne primes
    *'''Digits in M<sub>n</sub>''': denotes the [[Mersenne prime]] 2<sup>n</sup>-1 and a downloadable decimal representation ...n P<sub>n</sub>''': denotes the [[Perfect number]] 2<sup>n-1</sup> &bull; (2<sup>n</sup>-1) and a downloadable decimal representation
    2 KB (360 words) - 09:44, 6 March 2019
  • Mersenne prime
    ...is one less than a [[power of two]]. For example, 3 = 4 &minus; 1 = {{Kbn|2}} is a Mersenne prime; so is 7 = 8 &minus; 1 = {{Kbn|3}}. On the other hand :<math>M_n=2^n{-}1</math> .
    5 KB (857 words) - 14:53, 19 September 2021
  • Mersenne number
    A '''Mersenne number''' is a number of the form <math>2^n{-}1</math> where <math>n</math> is a non-negative [[integer]]. ...senne number <math>2^n{-}1</math> can be calculated by <math>\lfloor{n*log(2)}\rfloor+1</math> (see [[floor function]]).
    2 KB (351 words) - 11:28, 7 March 2019
  • Leonhard Euler
    ...for finite differences <math>\large\delta y</math> and <math>\large\delta^2 y</math> and many more.
    16 KB (2,614 words) - 11:48, 14 January 2024
  • Marin Mersenne
    : <math>\sqrt[4]{\frac{2}{3-\sqrt{2}}}</math> ...ined if the ratio of the air oscillation frequencies is also 1&nbsp;:&nbsp;2, which in turn is consistent with the source-air-motion-frequency-equivalen
    11 KB (1,582 words) - 01:17, 15 January 2024
  • Euclid
    ...c and fundamental parts of geometry; 1. A point is that which has no part. 2. A line is breadthless length. From these definitions of the point and the
    2 KB (341 words) - 11:43, 14 January 2024
  • Landon Curt Noll
    ...l candidates with prime [[exponent]]s up to and including M26. During that 2 hour period, it duplicated what had previously occurred over a 520 year per
    2 KB (333 words) - 12:40, 9 February 2022
  • Laura A. Nickel
    ...aura A. Nickel''') with [[Landon Curt Noll]] discovered on 1978-10-30 that 2<sup>21701</sup>-1 was the [[M25|25th Mersenne prime]]. This made internatio
    2 KB (254 words) - 01:23, 15 January 2024
  • David Slowinski
    | [[M27]] || 2<sup>{{Num|44497}}</sup>-1 || 1979-04-08 | [[M28]] || 2<sup>{{Num|86243}}</sup>-1 || 1982-09-25
    1 KB (213 words) - 23:53, 14 January 2024
  • Fermat number
    :{{V|F}}<sub>{{Vn}}</sub> = {{Kbn|+|1|2|2<sup>n</sup>}} :{{V|F}}<sub>1</sub> = {{Kbn|+|2}} = 5
    12 KB (1,913 words) - 14:35, 9 August 2021
  • M50
    The official discovery date for prime 2<sup>77 232 917</sup>-1 was 2017-12-26. See the [https://www.mersenne.org/pr ...glund also confirmed using Mlucas running on an [[Amazon EC2]] instance in 2.7 days
    2 KB (333 words) - 13:16, 17 February 2019
  • M49
    The official discovery date for 2<sup>{{Num|74207281}}</sup>-1 was 2016-01-07. See the [http://www.mersenne.o ...ill, who each ran the [[CUDALucas]] software on NVidia Titan Black GPUs in 2.3 days
    2 KB (283 words) - 11:50, 18 February 2019
  • Curtis Cooper
    ...-09-04 when the pair discovered the [[M44|44th]] known [[Mersenne prime]], 2<sup>32 582 657</sup>-1. As of 2008-09-15 his account is ranked #1 on [[Prim On 2013-01-25 Cooper discovered his third Mersenne prime, 2<sup>57 885 161</sup>-1, the [[M48|48th]] known.
    2 KB (237 words) - 11:34, 14 January 2024
  • Derrick Henry Lehmer
    ...k's father enabled them to find factors for all integers up to ''48911<sup>2</sup>'', and these factorisations were published in a book in 1929. That su ...improvement to the [[Lucas primality test]] for [[Mersenne prime]]s <math>2^p{-}1</math>, extending its application to all odd prime exponents ''p'', a
    6 KB (1,033 words) - 01:13, 15 January 2024
  • Home prime
    ==Base 2== HP<sub>2</sub>(10):
    980 bytes (143 words) - 13:22, 6 March 2019
  • Base 2 Home Prime Results
    ==Search for Home Primes base 2== {{HP|2|2295|281|189|2013-07-23|}}
    2 KB (175 words) - 18:45, 14 December 2023
  • Cunningham tables
    *[[2 Minus Tables]] *[[2 Plus Tables]]
    614 bytes (69 words) - 12:08, 13 February 2019
  • Cunningham project
    ...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
  • 2 Minus Tables
    ==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
    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
  • Lucas-Lehmer test
    ...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
  • Édouard Lucas
    ...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
  • Decimal
    ...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
  • Base
    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
  • Whole number
    *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
  • Integer
    ...[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
  • Mathematics
    ...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
  • Addition
    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
  • Multiplication
    ...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
  • Factorial number
    :<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
  • Division
    :<math>\frac 63 = 2</math> :<math>2 \times 3 = 6</math>.
    2 KB (368 words) - 16:58, 29 August 2022
  • Remainder
    ...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
  • Factoring Database
    **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-1
    1 KB (144 words) - 13:44, 24 January 2019
  • Factorization
    ...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
  • M48
    The official discovery date for 2<sup>{{Num|57885161}}</sup>-1 was 2013-01-25. See the [http://www.mersenne.o *[https://www.youtube.com/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
  • M47
    ...found. [[M45]], [[M46]], and M47 were discovered in the order of M47, M45 (2 weeks later), then M46 (8 months later). On 2018-04-08 all tests below 2<sup>{{Num|43112609}}</sup>-1 were verified by [[GIMPS]], officially making
    5 KB (694 words) - 13:17, 21 August 2019
  • Prime95
    ...fafaf; background-color: #f9f9f9; border-collapse: collapse;" cellpadding="2" !Comparison of CPU core power!!Frequency!!Cores!!colspan="2" | [[Fast Fourier transform|FFT]]!![[Trial factoring]]!!TDP
    11 KB (1,586 words) - 12:24, 7 August 2021
  • Even number
    ...n the physcial world, an even number of objects can be placed into exactly 2 groups that have the identical number of objects. All numbers ending in 0, 2, 4, 6, or 8 are even.
    425 bytes (61 words) - 11:19, 7 March 2019
  • Odd number
    An '''odd number''' is any [[integer]] that is not divisible by 2. ...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
  • M41
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.4 GHz Pentium 4 [[Personal computer|PC]] '''M41''' is the short hand used to refer to the 41st [[Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1.
    1 KB (203 words) - 11:26, 18 February 2019
  • M43
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2 GHz Pentium 4 [[Personal computer|PC]] '''M43''' is the short hand used to refer to the 43rd [[Mersenne prime]] 2<sup>{{Num|30402457}}</sup>-1.
    1 KB (191 words) - 11:31, 18 February 2019
  • M46
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 3 GHz Core 2 [[Personal computer|PC]] '''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>{{Num|42643801}}</sup>-1.
    2 KB (248 words) - 11:45, 18 February 2019
  • Riesel prime 2 21143
    |Rb=2
    403 bytes (26 words) - 18:40, 2 January 2023
  • Riesel prime 2 102765
    |Rb=2
    935 bytes (70 words) - 18:56, 10 December 2022

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

Retrieved from "https://www.rieselprime.de/ziki/Special:Search"