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 "Near-repdigit number" on this wiki! See also the search results found.

Page title matches

Page text matches

  • Number theory
    '''Number theory''' is a branch of pure [[mathematics]] devoted primarily to the stud
    202 bytes (29 words) - 12:55, 20 January 2019
  • Mlucas
    ...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
  • M48
    | 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
  • M47
    | 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
  • Prime95
    ...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
  • Even number
    ...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
  • Odd number
    An '''odd number''' is any [[integer]] that is not divisible by 2. *[[Even number]]
    316 bytes (42 words) - 11:21, 7 March 2019
  • CUDALucas
    ...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
  • Glucas
    ...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
  • M41
    | number=299410429404...882733969407 ...senneforum.org/txt/41.txt {{Num|7816230}} decimal digits] long. This prime number was the seventh record prime found by the [[GIMPS]] project.
    1 KB (203 words) - 11:26, 18 February 2019
  • M43
    | number=315416475618...411652943871 The number is [http://www.mersenneforum.org/txt/43.txt {{Num|9152052}} decimal digits]
    1 KB (191 words) - 11:31, 18 February 2019
  • M46
    | number=169873516452...765562314751 The number is [http://www.mersenneforum.org/txt/46.txt {{Num|12837064}} decimal digits
    2 KB (248 words) - 11:45, 18 February 2019
  • Distributed computing
    There are a number of individuals or groups in the fields of science, mathematics, cryptograph ...ng comes into the picture. Using the [[unused computing power]] of a large number of computers some of these problems can actually be solved within a reasona
    4 KB (674 words) - 12:11, 19 February 2019
  • CPU
    *Test to see if one number is larger than another *Move a number from one place to another
    2 KB (366 words) - 09:57, 13 February 2019
  • M42
    | number=122164630061...280577077247 ...senneforum.org/txt/42.txt {{Num|7816230}} decimal digits] long. This prime number was the eighth record prime found by the [[GIMPS]] project.
    934 bytes (118 words) - 11:26, 18 February 2019
  • M1
    | number= 3
    193 bytes (19 words) - 13:43, 17 February 2019
  • Conjectures 'R Us
    ...project]] in search for lowest [[Sierpiński number|Sierpiński]]/[[Riesel number|Riesel]] values.}} ...mbination of algebraic and trivial factor(s), or make [[Generalized Fermat number]]'s.
    3 KB (503 words) - 02:20, 1 May 2024
  • Fast Fourier transform
    Let ''x''<sub>0</sub>, ...., ''x''<sub>''n''-1</sub> be [[complex number]]s. The DFT is defined by the formula ...nd conquer algorithm that recursively breaks down a DFT of any [[Composite number|composite]] size ''n'' = ''n''<sub>1</sub>''n''<sub>2</sub> into many small
    17 KB (2,684 words) - 18:50, 28 September 2023
  • ClLucas
    ...penCL-based program written by [[Shoichiro Yamada]] for testing [[Mersenne number]]s for primality with [[Lucas-Lehmer test]]. It is an OpenCL counterpart of
    1 KB (137 words) - 18:48, 14 December 2023
  • GpuLucas
    ...[[CUDA]]-based program written by [[Andrew Thall]] for testing [[Mersenne number]]s for primality.
    2 KB (239 words) - 11:12, 13 February 2019

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

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