Search results
Results from the WOW.Com Content Network
Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Table of solutions, 1 ≤ n ≤ 20 [ edit ]
Packing circles in simple bounded shapes is a common type of problem in recreational mathematics. The influence of the container walls is important, and hexagonal packing is generally not optimal for small numbers of circles. Specific problems of this type that have been studied include: Circle packing in a circle; Circle packing in a square
Smale's problems: 18: 14: Stephen Smale: 1998 Millennium Prize Problems: 7: 6 [6] Clay Mathematics Institute: 2000 Simon problems: 15 <12 [7] [8] Barry Simon: 2000 Unsolved Problems on Mathematics for the 21st Century [9] 22-Jair Minoro Abe, Shotaro Tanaka: 2001 DARPA's math challenges [10] [11] 23-DARPA: 2007 Erdős's problems [12] >934: 617 ...
Despite the greatest strides in mathematics, these hard math problems remain unsolved. Take a crack at them yourself. ... You check this in your head for small numbers: 18 is 13+5, and 42 is 23+19 ...
Some of them, like the 3rd problem, which was the first to be solved, or the 8th problem (the Riemann hypothesis), which still remains unresolved, were presented precisely enough to enable a clear affirmative or negative answer. For other problems, such as the 5th, experts have traditionally agreed on a single interpretation, and a solution to ...
An Apollonian gasket with integer curvatures, generated by four mutually tangent circles with curvatures −10 (the outer circle), 18, 23, and 27. When four tangent circles described by equation (2) all have integer curvatures, the alternative fourth circle described by the second solution to the equation must also have an integer curvature ...
The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere. The counterparts of a circle in other dimensions can never be packed with complete efficiency in dimensions larger than one (in a one-dimensional universe, the circle analogue is just two points). That is ...
Title page Reinhardt's 1928 booklet in which he solved the second part of the problem. The second part of the problem asks whether there exists a polyhedron which tiles 3-dimensional Euclidean space but is not the fundamental region of any space group; that is, which tiles but does not admit an isohedral (tile-transitive) tiling.