Search results

Create the page "Near-repdigit number" on this wiki! See also the search results found.

Page title matches

• 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_n 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 × 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_n}} 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
• Generalized Fermat number 2 1 94
  {{Generalized Fermat number
  133 bytes (12 words) - 18:55, 17 September 2021

Page text matches

• 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
• M25
  | number=448679166119...353511882751 M25 is 2^{{{Num|21701}}}-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 ...^p-1 would divide into another number, now called a Lucas-Lehmer number denoted S_n where S₀=4 and S_n = (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
• Integer
  ...r ''Zahlen'' (German for "numbers"). They are also known as the '''[[whole number]]s''', although that term is also used to refer only to the positive intege [[Category:Number systems]]
  3 KB (404 words) - 14:58, 26 March 2023
• Mathematics
  '''Mathematics''' is the science of space, number and quantity. ...theorem: If you subtract an odd number from an even number you get an odd number.
  1 KB (186 words) - 17:00, 5 February 2019
• Multiplication
  '''Multiplication''' is the process of calculating the result when a number a is [[Addition|added]] to itself b times. The result of a multiplication i ...es are in [[exponent|exponentiation]] (<math>a^0=1</math>) and [[factorial number]]s (0!=1).
  2 KB (271 words) - 17:00, 29 August 2022
• Exponent
  ...wer a base number is raised to, the exponent is the superscript value of a number written as <math>a^p</math>. ...duct]] a &times; a &times; a &times; a is written as <math>a^4</math>, the number 4 is the index, or exponent.
  1 KB (273 words) - 16:56, 29 August 2022
• Factorial number
  ...or bang) after a number, it represents multiplying a number by all [[whole number|whole numbers]] smaller than it. *[[Multifactorial number]]
  729 bytes (93 words) - 13:40, 5 November 2023
• Factor
  A '''factor''' is one of the numbers or expressions that make up another number by [[multiplication]]. Let a and b be integers. Then a divides b (which may ...a number that has factors other than itself and 1 is called a [[composite number]].
  576 bytes (107 words) - 19:03, 5 February 2019
• Composite number
  ...he integers <math>a</math> and <math>b</math> are both greater than 1, the number is composite. *[[Wikipedia:Composite number|Wikipedia]]
  358 bytes (56 words) - 23:30, 26 October 2020
• Subtraction
  If the minuend is less than the subtrahend, the difference will be a negative number. For example, 17 &minus; 25 = ( &minus;8 ). We can say this as, "Seventeen
  893 bytes (128 words) - 16:58, 29 August 2022
• Factoring Database
  **Near Cunningham number **Near-repdigit
  1 KB (144 words) - 13:44, 24 January 2019
• Factorization
  ...ality tests|primality test]], we have to attempt the factorization of this number. The same can be said of the other factor ''b''. So it can be seen that we ..."special purpose" methods whose execution time depends on the size (i.e., number of digits), or on other particular properties of the factors.
  4 KB (642 words) - 12:57, 5 March 2019
• EFF prizes
  ...substantial award for the person that discovers a ten million digit prime number. ...00}}''' to the first individual or group who discovers a [[Megaprime|prime number with at least '''{{Num|1000000}} decimal digits''']] (awarded 2000-04-06)
  2 KB (321 words) - 18:50, 14 December 2023

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