• preceding Sierpiński problems had finally been solved, showing that 78557 is the smallest Sierpiński number and that 271129 is the smallest prime Sierpiński number...
    7 KB (816 words) - 13:19, 10 November 2024
  • Thumbnail for Wacław Sierpiński
    analytic sets. In 1916, Sierpiński gave the first example of an absolutely normal number. When World War I ended in 1918, Sierpiński returned to Lwów. However...
    15 KB (1,447 words) - 02:36, 24 October 2024
  • Thumbnail for Sierpiński triangle
    The Sierpiński triangle, also called the Sierpiński gasket or Sierpiński sieve, is a fractal with the overall shape of an equilateral triangle, subdivided...
    22 KB (2,673 words) - 14:55, 4 November 2024
  • {\displaystyle k} be a Sierpiński number or Riesel number divisible by 2 n − 1 {\displaystyle 2n-1} , and let p {\displaystyle p} be the largest number in a set of...
    21 KB (2,929 words) - 21:14, 4 November 2024
  • Thumbnail for Sierpiński carpet
    The Sierpiński carpet is a plane fractal first described by Wacław Sierpiński in 1916. The carpet is a generalization of the Cantor set to two dimensions;...
    10 KB (1,245 words) - 18:44, 28 September 2024
  • generalized Sierpiński number in base 10: 9175*10n+1 is always divisible by one of the prime numbers {7, 11, 13, 73}. 9180 – triangular number 9216 = 962...
    9 KB (1,006 words) - 18:20, 10 October 2024
  • k\times 2^{n}+1} , then k is a Sierpiński number. Unsolved problem in mathematics: Is 509,203 the smallest Riesel number? (more unsolved problems in mathematics)...
    23 KB (1,859 words) - 13:19, 10 November 2024
  • Thumbnail for Sierpiński curve
    Sierpiński curves are a recursively defined sequence of continuous closed plane fractal curves discovered by Wacław Sierpiński, which in the limit n →...
    10 KB (1,165 words) - 18:42, 28 September 2024
  • Thumbnail for Menger sponge
    ⁠log 9/log 3⁠=2 Apollonian gasket Cantor cube Koch snowflake Sierpiński tetrahedron Sierpiński triangle List of fractals by Hausdorff dimension Beck, Christian;...
    15 KB (1,826 words) - 17:53, 10 October 2024
  • which is neither trivial nor discrete. It is named after Wacław Sierpiński. The Sierpiński space has important relations to the theory of computation and...
    13 KB (1,918 words) - 13:46, 4 October 2024
  • Primality test Proth's theorem Pseudoprime Sierpiński number Sylvester's sequence For any positive odd number m {\displaystyle m} , 2 2 k m + 1 = ( a +...
    43 KB (4,589 words) - 12:22, 30 October 2024
  • Thumbnail for Chaos game
    Chaos game (redirect from Sierpiński game)
    the Sierpinski triangle. As the number of points is increased to a number N, the arrangement forms a corresponding (N-1)-dimensional Sierpinski Simplex...
    14 KB (1,725 words) - 15:08, 26 July 2024
  • {\displaystyle f_{i}(n)} . Selfridge's conjecture: is 78,557 the lowest Sierpiński number? Does the converse of Wolstenholme's theorem hold for all natural...
    190 KB (19,532 words) - 10:36, 2 November 2024
  • Allied Publishers, pp. 39–40, ISBN 9788170234647. Weisstein, Eric W. "Sierpiński Number of the First Kind". mathworld.wolfram.com. Retrieved 2020-07-30. Sloane...
    2 KB (338 words) - 13:34, 13 October 2024
  • Thumbnail for Fibonacci sequence
    In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci...
    86 KB (13,054 words) - 06:42, 4 November 2024
  • theorem Taxicab number Generalized taxicab number Cabtaxi number Schnirelmann density Sumset Landau–Ramanujan constant Sierpinski number Seventeen or Bust...
    10 KB (937 words) - 23:04, 14 September 2024
  • Thumbnail for Perfect number
    In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number...
    37 KB (5,047 words) - 14:36, 21 October 2024
  • Thumbnail for Natural number
    the number 1 differently than larger numbers, sometimes even not as a number at all. Euclid, for example, defined a unit first and then a number as a...
    53 KB (5,856 words) - 18:47, 4 November 2024
  • Proth prime (redirect from Proth number)
    the smallest Sierpinski number (Sierpinski problem), has found 11 large Proth primes by 2007. Similar resolutions to the prime Sierpiński problem and extended...
    14 KB (1,378 words) - 04:56, 22 October 2024
  • sizes, including holes) in Sierpiński's triangle after 5 inscriptions RS-485 486 = 2 × 35, Harshad number, Perrin number Shorthand for the Intel 80486...
    36 KB (5,449 words) - 01:57, 17 October 2024
  • Thumbnail for Aleph number
    letter aleph is often printed upside down by accident – for example, in Sierpiński (1958): 402  the letter aleph appears both the right way up and upside...
    16 KB (1,957 words) - 08:24, 25 September 2024
  • 70,000 (redirect from 70000 (number))
    Kaprekar number 78125 = 57 78163 = Friedman prime 78498 = the number of primes under 1,000,000 78557 = conjectured to be the smallest Sierpiński number 78732...
    3 KB (360 words) - 23:50, 16 October 2024
  • Thumbnail for Prime number
    Unique factorization". Elementary number theory (2nd ed.). W.H. Freeman and Co. p. 10. ISBN 978-0-7167-0076-0. Sierpiński, Wacław (1988). Elementary Theory...
    117 KB (14,169 words) - 21:52, 8 November 2024
  • In mathematics, a polygonal number is a number that counts dots arranged in the shape of a regular polygon: 2-3 . These are one type of 2-dimensional figurate...
    24 KB (1,101 words) - 17:46, 3 November 2024
  • Thumbnail for Composite number
    A composite number is a positive integer that can be formed by multiplying two smaller positive integers. Equivalently, it is a positive integer that has...
    6 KB (848 words) - 19:03, 9 November 2024
  • measure-zero set is countable. The existence of Sierpiński sets is independent of the axioms of ZFC. Sierpiński (1924) showed that they exist if the continuum...
    3 KB (334 words) - 13:28, 19 September 2024
  • Thumbnail for Analytic number theory
    the circle is a significant improvement. The first to attain this was Sierpiński in 1906, who showed E ( r ) = O ( r 2 / 3 ) {\displaystyle E(r)=O(r^{2/3})}...
    27 KB (3,825 words) - 07:06, 21 July 2024
  • In number theory, an n-smooth (or n-friable) number is an integer whose prime factors are all less than or equal to n. For example, a 7-smooth number is...
    12 KB (1,561 words) - 17:42, 15 October 2024
  • Thumbnail for Sierpiński's constant
    the solid horizontal line. Wacław Sierpiński [1] http://www.plouffe.fr/simon/constants/sierpinski.txt - Sierpiński's constant up to 2000th decimal digit...
    3 KB (406 words) - 13:04, 7 October 2024
  • 1729 is the natural number following 1728 and preceding 1730. It is the first nontrivial taxicab number, expressed as the sum of two cubic numbers in...
    11 KB (1,264 words) - 20:17, 17 October 2024