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...

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...

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...

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;...

{\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...

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...

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 →...

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...

OEIS: A046069 or OEIS: A108129 (not allowing n = 0) A number may be simultaneously Riesel and Sierpiński. These are called Brier numbers. The five smallest...

⁠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;...

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 +...

{\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...

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...

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...

the Sierpinski triangle. As the number of points is increased to a number N, the arrangement forms a corresponding (N-1)-dimensional Sierpinski Simplex...

theorem Taxicab number Generalized taxicab number Cabtaxi number Schnirelmann density Sumset Landau–Ramanujan constant Sierpinski number Seventeen or Bust...

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...

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...

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...

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...

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...

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...

An n-flake, polyflake, or Sierpinski n-gon,: 1  is a fractal constructed starting from an n-gon. This n-gon is replaced by a flake of smaller n-gons, such...

Springer-Verlag. ISBN 0-387-20860-7. OCLC 54611248. Zbl 1058.11001. Section B2. Sierpiński, Wacław (1965). "Sur les nombres pseudoparfaits". Mat. Vesn. Nouvelle...

the smallest Sierpinski number (Sierpinski problem), has found 11 large Proth primes by 2007. Similar resolutions to the prime Sierpiński problem and extended...

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...

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...

related to Sierpinski and Riesel numbers. These are odd natural numbers k for which the formula k 2n + 1 (Sierpinski number) or k 2n − 1 (Riesel number) produces...

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...

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...