TOPICS
Search

Search Results for ""


171 - 180 of 1833 for Disk covering problemSearch Results
In a game proposed by J. H. Conway, a devil chases an angel on an infinite chessboard. At each move, the devil can eliminate one of the squares, and the angel can make a leap ...
Whirls are figures constructed by nesting a sequence of polygons (each having the same number of sides), each slightly smaller and rotated relative to the previous one. The ...
A flat disk that acts as a two-sided die.
Find the plane lamina of least area A which is capable of covering any plane figure of unit generalized diameter. A unit circle is too small, but a hexagon circumscribed on ...
The portion of a surface left when an open disk is removed from it.
Let there be n>=2 integers 0<a_1<...<a_n with GCD(a_1,a_2,...,a_n)=1. The values a_i represent the denominations of n different coins, where these denominations have greatest ...
Maximize the amount of floor space which can be covered with a fixed tile (Hoffman 1998, p. 173).
Given a subspace A of a space X and a map from A to a space Y, is it possible to extend that map to a map from X to Y?
Various handshaking problems are in circulation, the most common one being the following. In a room of n people, how many different handshakes are possible? The answer is (n; ...
How many times can a shape be completely surrounded by copies of itself without being able to tile the entire plane, i.e., what is the maximum (finite) Heesch number?
1 ... 15|16|17|18|19|20|21 ... 184 Previous Next

...