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

  • Abundant number
    An '''abundant number''' is any number, '''''n''''', which has a [[sigma|sigma value]] greater than '''''2n'''''. ...bers increase the size of an [[aliquot sequence]] because when an abundant number occurs in a sequence, the next step is larger than the current step. Also,
    671 bytes (92 words) - 00:34, 30 January 2019
  • Smooth number
    A '''smooth number''' is an [[integer]] whose [[prime]] [[factor]]s are less or equal to a pre If this bound is B, we can say that the number is B-smooth.
    436 bytes (63 words) - 21:36, 3 February 2019
  • Triangular number
    ..." (because it is triangular) after a number) represents the summing of a number with all whole numbers smaller than it. *[[Wikipedia:Triangular_number|Triangular number]]
    655 bytes (81 words) - 12:49, 25 March 2019
  • Proth number
    In [[number theory]], a '''Proth number''' is a number of the form A [[Proth prime]] is a Proth number, which is prime.
    670 bytes (104 words) - 10:59, 9 July 2021
  • GIMPS chances of finding a prime number
    ...are used to calculate the probability of something happening based on the number of possible outcomes, not on what the last three or three hundred outcomes ...your next throw are 1:6. What has happened in the past does not affect the number of faces on the dice, which is all that is used to calculate the odds.
    3 KB (593 words) - 10:09, 7 March 2019
  • Woodall number
    In [[number theory]], a '''Woodall number''' W<sub>n</sub> is any [[natural number]] of the form for some natural number ''n''.
    374 bytes (59 words) - 16:41, 31 August 2021
  • General number field sieve
    {{Shortcut|GNFS|General number field sieve: most efficient classical [[Factorization|factoring method]] fo ...r field sieve (GNFS)''' is the most efficient classical [[algorithm]] in [[number theory]] for [[Factorization|factoring]] [[integer]]s with 100+ [[digit]]s.
    478 bytes (59 words) - 12:04, 19 February 2019
  • Square number
    ...mbers are included, then the ratio of two square integers is also a square number (e.g. 2/3&nbsp;&times;&nbsp;2/3 = 4/9). The number ''m'' is a square number if and only if one can arrange ''m'' points in a square.
    3 KB (408 words) - 13:56, 19 February 2019
  • Sierpiński number base 5
    ...5''' is a value of {{Vk}} such that {{Kbn|+|k|5|n}} is always [[composite number|composite]]. In order to demonstrate whether {{Num|159986}} is the smallest Sierpiński number base 5 or not, a [[distributed computing project]] was created named [[Sier
    556 bytes (83 words) - 10:57, 14 October 2020
  • Riesel number base 5
    ...5''' is a value of ''k'' such that {{Kbn|-|k|5|n}} is always a [[composite number]]. In order to demonstrate whether {{Num|346802}} is the smallest Riesel number base 5 or not, a [[distributed computing project]] was created named [[Sier
    589 bytes (90 words) - 10:30, 26 March 2024
  • Cullen number
    A '''Cullen number''' {{V|C<sub>n</sub>}} is a number of the form {{Kbn|+|n|2|n}}, a '''generalized Cullen number''' base {{Vb}} is a number of the form {{Kbn|+|n|b|n}}. '''(perhaps own page?)'''
    2 KB (252 words) - 17:39, 31 August 2021
  • Number
    [[Category:Number| ]]
    49 bytes (7 words) - 13:26, 6 March 2019
  • Multifactorial number
    A [[Factorial number]] is defined by the product A '''Multifactorial number''' is denoted by
    560 bytes (81 words) - 14:36, 20 July 2021
  • Generalized Fermat number 12 5 1
    {{Generalized Fermat number
    128 bytes (12 words) - 09:57, 30 July 2021
  • Generalized Fermat number 12 7 1
    {{Generalized Fermat number
    125 bytes (12 words) - 15:10, 17 August 2021
  • Generalized Fermat number 2 1 116
    {{Generalized Fermat number
    133 bytes (12 words) - 07:54, 18 September 2021
  • Leyland number
    A '''Leyland number''' is a number that can be expressed in the form <math>x^y+y^x</math>, where x and y are p A '''Leyland prime''' is a Leyland number which is also a [[prime]] (see {{OEIS|l|A094133}}).
    8 KB (906 words) - 09:59, 5 January 2023
  • Saouter number
    A '''Saouter number''' is a type of [[Generalized Fermat number]]. Numbers of this type have the form ...to this, these numbers share similar properties to those held by [[Fermat number]]s. These numbers were named by [[Tony Reix]]<ref>[https://www.mersenneforu
    869 bytes (128 words) - 07:02, 15 August 2019
  • Generalized Fermat number 2 1 107
    {{Generalized Fermat number
    133 bytes (12 words) - 07:49, 18 September 2021
  • Generalized Fermat number 2 1 99
    {{Generalized Fermat number
    127 bytes (12 words) - 19:00, 17 September 2021

Page text matches

  • Fermat number
    In [[mathematics]], a '''Fermat number''', named after [[Pierre de Fermat]] who first studied them, is a positive ...up> + 1).) In other words, every prime of the form {{Kbn|+|n}} is a Fermat number, and such primes are called '''Fermat primes'''. The only known Fermat prim
    12 KB (1,913 words) - 14:35, 9 August 2021
  • M50
    | number=467333183359...069762179071 ...mputer network administrator. [https://www.popsci.com/worlds-largest-prime-number-discovered] The primality proof took 6 days of non-stop computing.
    2 KB (333 words) - 13:16, 17 February 2019
  • M49
    | number=300376418084...391086436351 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 (283 words) - 11:50, 18 February 2019
  • Derrick Henry Lehmer
    ...factoring a number ''N'' is hereby reduced to the discovery of an adequate number of quadratic residues ''R'' of ''N'' and the superposition of the correspon ...ber sieves]] to be run on a computer. He had previously built an automatic number sieve from a small electric motor and some bicycle chains hanging from spro
    6 KB (1,033 words) - 01:13, 15 January 2024
  • Titanic prime
    A '''Titanic prime''' is a [[prime]] number whose decimal representation has {{Num|1000}} or more digits.
    394 bytes (48 words) - 11:40, 2 July 2020
  • Gigantic prime
    A '''gigantic prime''' is a [[prime]] number whose decimal representation has at least {{Num|10000}} [[digit]]s.
    515 bytes (67 words) - 13:38, 6 March 2019
  • Megaprime
    A '''Megaprime''' is a [[prime]] number whose decimal representation has {{Num|1000000}} or more digits. There are ...st is avalable [http://primes.utm.edu/primes/search.php?MinDigits=1000000&&Number=10000&Style=HTML here].
    806 bytes (111 words) - 07:59, 14 July 2021
  • Gigaprime
    A '''Gigaprime''' is a [[prime]] number whose [[decimal]] representation has {{Num|1000000000}} or more [[digit]]s. [[Operation Billion Digits]] is factoring [[Mersenne number]]s in this range.
    871 bytes (119 words) - 07:54, 14 July 2021
  • Home prime
    [[Category:Number]]
    980 bytes (143 words) - 13:22, 6 March 2019
  • Cunningham project
    ...it is considered the oldest continuously ongoing activity in computational number theory. ...exponent. The second type is [[aurifeuillian factor]], in which the whole number can be split into two parts directly, for certain combination of values of
    7 KB (1,150 words) - 23:48, 19 April 2023
  • Template:FDBCunningham
    * <count>: number of ''n'' to show
    1 KB (189 words) - 12:00, 13 February 2019
  • Template:FDBID
    * <ID>: ID of the number in the FactorDB
    568 bytes (71 words) - 09:41, 17 January 2019
  • M25
    | number=448679166119...353511882751 M25 is 2<sup>{{Num|21701}}</sup>-1, a number of {{Num|6533}} [[digit]]s.
    2 KB (303 words) - 11:01, 26 February 2019
  • Lucas-Lehmer test
    ...cas-Lehmer test''' is a deterministic algorithm used to prove a [[Mersenne number]] either composite or prime. It is the last stage in the procedure employed ...<sup>p</sup>-1 would divide into another number, now called a Lucas-Lehmer number denoted S<sub>n</sub> where S<sub>0</sub>=4 and S<sub>n</sub> = (S<sub>n-1<
    20 KB (3,572 words) - 14:30, 17 February 2019
  • Édouard Lucas
    ...[[Mersenne prime]] for almost 75 years, and is still the highest [[prime]] number discovered without the aid of a computer.
    2 KB (296 words) - 01:09, 15 January 2024
  • Edson Smith
    .... In August 2008, one of these computers found a [[M47| World record prime number.]] ...a.edu) discovered a new prime [[M47]]. It remained the largest known prime number for almost four and a half years.
    4 KB (564 words) - 00:11, 15 January 2024
  • Digit
    ...g fingers) of the hands correspond to the 10 symbols of the common base 10 number system, i.e. the [[decimal]] (ancient Latin adjective ''dec.'' meaning ten) In a given number system, if the [[base]] is an integer, the number of digits required is always equal to the absolute value of the base.
    1 KB (171 words) - 10:17, 18 January 2019
  • Decimal
    ...base 2. The length of a number (how many [[digit]]s it takes to write the number) depends upon the base.
    1 KB (190 words) - 10:23, 18 January 2019
  • Base
    In [[Mathematics]], a '''base''' or '''radix''' is the number of different [[digit]]s that a system of counting uses to represent numbers Bases must be a [[whole number]] bigger than 0. If it was 0, then there would be no digits.
    2 KB (399 words) - 10:37, 18 January 2019
  • Whole number
    The term '''whole number''' does not have a consistent definition. Various authors use it in one of *the positive integers (1, 2, 3, ...) (often called [[natural number]]s)
    413 bytes (54 words) - 09:51, 8 February 2019

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

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