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

  • Category:Number
    22 members (6 subcategories, 0 files) - 13:25, 6 March 2019
  • Mersenne number
    A '''Mersenne number''' is a number of the form <math>2^n{-}1</math> where <math>n</math> is a non-negative [[i ...[prime]], it is called a [[Mersenne prime]], otherwise it is a [[composite number]].
    2 KB (351 words) - 11:28, 7 March 2019
  • 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
  • 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
  • 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
  • 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
  • Number theory
    '''Number theory''' is a branch of pure [[mathematics]] devoted primarily to the stud
    202 bytes (29 words) - 12:55, 20 January 2019
  • 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
  • Real number
    A '''real number''' is either a [[rational number]] or an [[irrational number]]. The set of real numbers is denoted by <math>\mathbb{R}</math>. *[[Wikipedia:Real_number|Real number]]
    390 bytes (57 words) - 15:00, 26 March 2023
  • Rational number
    A '''rational number''' is a [[real number]] which can be written as <math>\frac{a}{b}</math> or <math>a/b</math> wher ...r [[greatest common divisor]]. This operation does not change the rational number represented by the fraction.
    3 KB (541 words) - 15:01, 26 March 2023
  • Irrational number
    ...an '''irrational number''' is any [[real number]] that is not a [[rational number]], i.e., one that cannot be written as a ratio of two integers, i.e., it is *[[Wikipedia:Irrational_number|Irrational number]]
    763 bytes (124 words) - 15:14, 26 March 2023
  • Natural number
    *[[Whole number]] *[[Wikipedia:Natural_number|Natural number]]
    316 bytes (43 words) - 15:00, 26 March 2023
  • Sierpiński number
    ...l number {{Vk}} such that all {{Kbn|+|k|n}} for all {{Vn}} are [[Composite number|composite]]. *[[Wikipedia:Sierpiński_number|Sierpiński number]]
    324 bytes (48 words) - 13:37, 8 April 2023
  • Perfect number
    In [[mathematics]], a '''perfect number''' is defined as an integer which is the sum of its proper positive divisor ...and 3 are its proper positive divisors and 1 + 2 + 3 = 6. The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. The next perfect numbers are 496 and 8128.
    6 KB (885 words) - 11:33, 7 March 2019
  • Riesel number
    ...value of ''k'' such that {{Kbn|k|n}} is always composite for all [[natural number]]s. In order to demonstrate whether 509203 is the smallest Riesel number or not (the '''[[Riesel problem 1]]'''), a [[distributed computing project]
    827 bytes (112 words) - 08:21, 25 March 2024
  • 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
  • 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
  • Special number field sieve
    {{Shortcut|SNFS|Special number field sieve: special-purpose [[factorization]] algorithm.}} ...(SNFS)''' is a special-purpose [[factorization]] algorithm. The [[general number field sieve]] (GNFS) was derived from it.
    1 KB (186 words) - 12:07, 19 February 2019
  • Generalized Fermat number
    There are different kinds of '''generalized [[Fermat number]]s'''. :<math>F_{0,r}</math> generates the [[Mersenne number]]s.
    5 KB (726 words) - 09:57, 12 September 2021

Page text matches

  • User:Karbon
    <code>number = 1234567.896</code> $number = 1234567.896;
    3 KB (328 words) - 07:35, 3 July 2020
  • MediaWiki:Sidebar
    ** Leyland_number|Leyland number ** Category:Number|Number
    929 bytes (99 words) - 17:14, 5 April 2024
  • Category:Prime
    [[Category:Number]]
    20 members (9 subcategories, 0 files) - 14:25, 6 March 2019
  • Williams prime
    A '''Williams number''' is a [[natural number]] of the form {{Kbn|(b-1)|b|n}} for integers ''b'' ≥ 2 and ''n'' ≥ 1. A '''Williams prime''' is a Williams number which is [[prime]].
    5 KB (744 words) - 07:30, 5 August 2019
  • Category:Reserved
    |resultsheader=There are %PAGES% reserved number sequences.
    131 members (2 subcategories, 0 files) - 09:53, 10 March 2020
  • Template:Short
    "en": "Short data for a prime number sequence",
    1 KB (137 words) - 18:49, 13 December 2018
  • MediaWiki:Gadget-Vorlagenmeister/core.js
    // return identified number, or defaultspace if ( typeof( e.which ) === "number" ) {
    129 KB (11,879 words) - 13:07, 13 December 2018
  • Template:GP
    ...:{{{1}}}|Generalized Fermat number}}|{{#vardefine:_type|Generalized Fermat number}}{{#vardefine:_short|GF}}}}<!--
    3 KB (311 words) - 18:08, 13 August 2021
  • Template:NVal
    ::W: [[Woodall number|(generalized) Woodall prime]] ::C: [[Cullen number|(generalized) Cullen prime]]
    3 KB (440 words) - 16:51, 22 March 2024
  • Splitting a sieve file
    Splitting a sieve file in [[PRP-LLR format]] into a number of separate files using <code>[[wikipedia:AWK|awk]]</code>.
    1 KB (203 words) - 18:52, 2 October 2022
  • Template:Greatest Mersenne Prime
    :<code>number</code>: The number in TeX-notation is given with a link to the page for that Mersenne prime. :<code>only</code>: The number in HTML-notation is given for that Mersenne prime, language specific delimi
    2 KB (264 words) - 16:55, 7 April 2019
  • Great Internet Mersenne Prime Search
    ...primes are much rarer than ordinary primes, of which there are an infinite number. The GIMPS effort, exhaustively searching for possible candidates since 199
    3 KB (450 words) - 14:37, 21 August 2019
  • List of known Mersenne primes
    *'''#''': number count of the Mersenne primes linked to that prime page *'''Digits in P<sub>n</sub>''': denotes the [[Perfect number]] 2<sup>n-1</sup> &bull; (2<sup>n</sup>-1) and a downloadable decimal repre
    2 KB (360 words) - 09:44, 6 March 2019
  • Mersenne prime
    More generally, [[Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are ...ved that all [[even number|even]] perfect numbers have this form. No [[odd number|odd]] perfect numbers are known, and it is suspected that none exists.
    5 KB (857 words) - 14:53, 19 September 2021
  • Mersenne number
    A '''Mersenne number''' is a number of the form <math>2^n{-}1</math> where <math>n</math> is a non-negative [[i ...[prime]], it is called a [[Mersenne prime]], otherwise it is a [[composite number]].
    2 KB (351 words) - 11:28, 7 March 2019
  • Leonhard Euler
    ...his approach to mathematical research becomes apparent. He saw studies of number theory as being vital to the foundations of calculus, and that special func ...to denote the circumference of a circle. Johann Bernoulli represented the number by c. Euler in 1734 denoted it by p, and in a letter of 1736 (in which he f
    16 KB (2,614 words) - 11:48, 14 January 2024
  • Pierre de Fermat
    ...ctures that were later proven or refuted by other mathematicians. [[Fermat number]]s are named after him.
    429 bytes (63 words) - 11:44, 14 January 2024
  • Landon Curt Noll
    ...ted in the New York times on 1978-11-21. The 18 year-olds were studying [[number theory]] at the time at CSUH with Dr. [[Derrick Henry Lehmer]] of [[Univers ...e [[multiplication]]s need in [[Lucas-Lehmer test]]ing of large [[Mersenne number]]s.
    2 KB (333 words) - 12:40, 9 February 2022
  • Laura A. Nickel
    ...l and Nickel were still high school students. For the verification of this number alone, the pair used almost eight hours of time running an assembly languag
    2 KB (254 words) - 01:23, 15 January 2024
  • Scott Kurowski
    Entropia grew to collaborate with a number of major technology companies including IBM and British Aerospace in the fi
    985 bytes (141 words) - 01:30, 15 January 2024

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

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