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

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

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

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

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

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

snowflake List of fractals by Hausdorff dimension Sierpiński carpet Sierpiński tetrahedron Sierpiński triangle Beck, Christian; Schögl, Friedrich (1995)...

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

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

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

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

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

game Sierpiński space Sierpiński's theorem on metric spaces Sierpiński problem Prime Sierpiński problem Extended Sierpiński problem Sierpiński-Riesel...

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 Sierpinski triangle. As the number of points is increased to a number N, the arrangement forms a corresponding (N-1)-dimensional Sierpinski Simplex...

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

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

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

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

month, the number of pairs of rabbits is equal to the number of mature pairs (that is, the number of pairs in month n – 2) plus the number of pairs alive...

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

1729 is the natural number following 1728 and preceding 1730. It is the first nontrivial taxicab number, expressed as the sum of two cubic positive integers...

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

existence of normal numbers. Wacław Sierpiński (1917) showed that it is possible to specify a particular such number. Becher and Figueira (2002) proved...

Thomas (2013), Set Theory (2nd ed.), Springer, ISBN 978-3-662-22400-7. Sierpiński, W. (1965), Cardinal and Ordinal Numbers (2nd ed.), Warszawa: Państwowe...

mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2n − 1 for some integer...

special case k = 1, where one chooses a = 3) Sierpiński number Paulo Ribenboim (1996). The New Book of Prime Number Records. New York, NY: Springer. p. 52....

A composite number is a positive integer that can be formed by multiplying two smaller positive integers. Accordingly it is a positive integer that has...