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

  • 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
  • Riesel prime 2 182627
    |Rb=2
    255 bytes (24 words) - 22:20, 10 December 2022
  • Proth prime 2 1089927
    |Pb=2
    440 bytes (36 words) - 07:56, 17 May 2024
  • Proth prime 2 12321
    |Pb=2
    498 bytes (31 words) - 13:34, 2 January 2023
  • Riesel prime 2 187605
    |Rb=2 2;T:S
    490 bytes (35 words) - 12:22, 11 December 2022
  • Riesel prime 2 132165
    |Rb=2 2
    557 bytes (25 words) - 12:35, 11 December 2022
  • Proth prime 2 1943873
    |Pb=2
    334 bytes (32 words) - 15:12, 27 January 2023
  • Program
    ...Programming, Volume 2, 3rd Edition, 1997, Addison-Wesley, ISBN 0-201-89684-2
    2 KB (263 words) - 11:53, 7 February 2019
  • M42
    | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.4 GHz Pentium 4 [[Personal computer|PC]] '''M42''' refers to the 42nd [[Mersenne prime]] 2<sup>{{Num|25964951}}</sup>-1.
    934 bytes (118 words) - 11:26, 18 February 2019
  • M1
    | nvalue= 2
    193 bytes (19 words) - 13:43, 17 February 2019
  • Conjectures 'R Us
    ...t in proving the [[Liskovets-Gallot conjectures]] for the forms {{Kbn|±|k|2|n}} where {{Vn}} is always odd '''and''' where {{Vn}} is always even. ==Sub-project #2==
    3 KB (503 words) - 02:20, 1 May 2024
  • Fast Fourier transform
    :<math>\large f_j = \sum_{k=0}^{n-1} x_k e^{-{2\pi i \over n} jk } \qquad j = 0, ... ,n-1.</math> Evaluating these sums directly would take O(''n''<sup>2</sup>) arithmetical operations . An FFT is an algorithm to compute the same
    17 KB (2,684 words) - 18:50, 28 September 2023

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

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