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

  • Mprime (Cray)
    ...id Slowinski]] (later versions with [[Paul Gage]]), for testing [[Mersenne number]]s for [[Prime|primality]] on [[Cray Research|Cray]] [[Classes of computers
    639 bytes (92 words) - 12:02, 7 February 2019
  • Probable prime
    ...ecific conditions. While there may be probable primes that are [[Composite number|composite]] (called [[pseudoprime]]s), the condition is generally chosen in ...mality test (like [[Lucas-Lehmer test]]) will be needed to find out if the number is really composite or not.
    2 KB (232 words) - 07:28, 12 March 2024
  • Pseudoprime
    A '''pseudoprime''' is a [[composite number]] which passes some probabilistic [[primality test]]s. For example, a ''strong pseudoprime'' is a composite number that passes one iteration the [[Miller-Rabin pseudoprimality test]].
    1 KB (155 words) - 20:32, 25 July 2020
  • Floating-point
    ...onent]]. The [[base]] for the scaling is normally 2, 10 or 16. The typical number that can be represented exactly is of the form: ...at is, it can be placed anywhere relative to the significant digits of the number. This position is indicated separately in the internal representation, and
    2 KB (294 words) - 22:56, 3 February 2019
  • Factor5
    ...actoring program|program]] that performs [[Trial factoring]] of [[Mersenne number]]s. It is capable of trial factoring very large numbers, many billions of d :"factor <exponent> <start_bit> <stop_bit> <number of threads to use>"
    1 KB (201 words) - 21:16, 25 January 2019
  • Complex number
    A '''complex number''' is defined as a pair of [[real number]]s <math>z = (x, y)</math> where the following operations are defined: ...mbers behaves as real numbers. That's why the first element of the complex number is known as the ''real part'' and the second element as the ''imaginary par
    2 KB (280 words) - 14:59, 26 March 2023
  • Luigi Morelli
    ...upporting [[Trial factoring|factorization]] of large (or small) [[Mersenne number]]s, he wrote the [[Factor5]] [[program]]. As of February 2011, he wrote som ...w [http://www.doublemersennes.org/ website] dealing with [[Double Mersenne number]]s.
    1 KB (154 words) - 01:15, 15 January 2024
  • Operation Billion Digits
    ...e also unfeasible because they require operations modulo the billion digit number. The only part of this project that can be undertaken today is [[trial fact ...er the starting one. If you want to do a bigger range, just input a higher number here (be aware that adding a bit depth takes twice the time than the previo
    6 KB (918 words) - 16:28, 24 July 2020
  • M37
    | number=127411683030...973024694271 ...[[Roland Clarkson]], using [[Prime95]] written by [[George Woltman]]. The number is [http://www.mersenneforum.org/txt/37.txt {{Num|909526}} decimal digits]
    877 bytes (111 words) - 11:04, 18 February 2019
  • GIMPS factoring and sieving
    ...a factor than to do the Lucas-Lehmer Test; in fact, over 60% of [[Mersenne number]]s with prime exponents are eliminated from consideration as possible prime ...given Mersenne number up to some predetermined size, usually a prescribed number of bits.
    6 KB (962 words) - 10:08, 7 March 2019
  • Quadratic residue
    In [[mathematics]], a number {{V|q}} is called a '''quadratic residue''' [[modular arithmetic|modulo]] { In effect, a quadratic residue modulo {{V|p}} is a number that has a [[Modular square root|square root]] in [[modular arithmetic]] wh
    823 bytes (117 words) - 20:11, 26 October 2020
  • Modular square root
    A '''modular square root''' <math>r</math> of an [[integer]] number <math>a</math> modulo an integer <math>m</math> greater than 1 is an intege ...o zero, there is only one modular square root, namely zero. Otherwise, the number of square roots can be two or zero depending on whether the argument is a [
    5 KB (726 words) - 10:38, 6 February 2019
  • Legendre symbol
    If <math>p</math> is an odd [[prime]] number and <math>a</math> is an [[integer]], then the Legendre symbol There are a number of useful properties of the Legendre symbol which can be used to speed up c
    2 KB (348 words) - 18:57, 28 September 2023
  • Law of quadratic reciprocity
    ...</math> is a [[quadratic residue]] or non-residue modulo another odd prime number <math>q</math> if we know whether <math>q</math> is a quadratic residue or
    1 KB (208 words) - 18:19, 2 October 2022
  • Non-negative
    ...integers from zero upwards, and the non-negative reals are all the [[real number]]s from zero upwards. All whole numbers are non-negative.
    421 bytes (66 words) - 22:51, 26 January 2019
  • Ten million digits
    After the discovery of [[M38]] (the first [[megaprime]] or [[prime]] number greater than 1 million [[decimal]] [[digit]]s) in June of 1999, the next [[ ...was found, [[M46]]. By the end of 2010, all exponents that would produce a number less than {{Num|10000000}} digits had been [[primality test|tested]] at lea
    979 bytes (146 words) - 14:23, 6 March 2019
  • Mmff
    ...man for [[trial factoring]] small [[Fermat number]]s and [[double Mersenne number]]s.
    355 bytes (45 words) - 00:00, 27 January 2019
  • Double Mersenne number
    ...ble Mersenne number''' is a number where the exponent is also a [[Mersenne number]] and usually a [[Mersenne prime]]. These are generally denoted as '''MM<su ...igit]]s long. [[Tony Forbes]] lead an effort to find a [[factor]] for this number. The search has included all '''''[[Value k|k]]''''' values up to {{Num|116
    4 KB (655 words) - 14:50, 19 September 2021
  • PSearch
    ! scope="col" | Number ...ate, it was the 15th largest prime number, and the 2nd largest Proth prime number.
    1 KB (182 words) - 08:17, 12 July 2020
  • P-1 factorization method
    Let ''p'' be a prime divisor of the number ''N'' to be factored. If we somehow find a multiple of ''p-1'' we will find ...e method proceeds to compute <math>a^E\,\pmod{N}</math> where ''N'' is the number to factor.
    5 KB (814 words) - 01:35, 12 March 2019

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

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