TOPICS
Search

Search Results for ""


21 - 30 of 112 for SierpinskiSearch Results
The Menger sponge is a fractal which is the three-dimensional analog of the Sierpiński carpet. The nth iteration of the Menger sponge is implemented in the Wolfram Language ...
The largest known prime numbers are Mersenne primes, the largest of these known as of September 2013 bing 2^(57885161)-1, which has a whopping 17425170 decimal digits. As of ...
A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...
A substitution system in which rules are used to operate on a string consisting of letters of a certain alphabet. String rewriting systems are also variously known as ...
A uniquely k-colorable graph G is a chi-colorable graph such that every chi-coloring gives the same partition of G (Chao 2001). Examples of uniquely minimal colorable classes ...
There exist infinitely many odd integers k such that k·2^n-1 is composite for every n>=1. Numbers k with this property are called Riesel numbers, while analogous numbers with ...
The Moser spindle is the 7-node unit-distance graph illustrated above (Read and Wilson 1998, p. 187). It is sometimes called the Hajós graph (e.g., Bondy and Murty 2008. p. ...
Rule 90 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
For every positive integer n, there exists a sphere which has exactly n lattice points on its surface. The sphere is given by the equation ...
A circle having a given number of lattice points on its circumference. The Schinzel circle having n lattice points is given by the equation {(x-1/2)^2+y^2=1/45^(k-1) for n=2k ...
1|2|3|4|5|6 ... 12 Previous Next

...