Circle packing in an equilateral triangle
Template:Short description Template:Unsolved
Circle packing in an equilateral triangle is a packing problem in discrete mathematics where the objective is to pack Template:Mvar unit circles into the smallest possible equilateral triangle. Optimal solutions are known for Template:Math and for any triangular number of circles, and conjectures are available for Template:Math.[1][2][3]
A conjecture of Paul Erdős and Norman Oler states that, if Template:Mvar is a triangular number, then the optimal packings of Template:Math and of Template:Mvar circles have the same side length: that is, according to the conjecture, an optimal packing for Template:Math circles can be found by removing any single circle from the optimal hexagonal packing of Template:Mvar circles.[4] This conjecture is now known to be true for Template:Math.[5]
Minimum solutions for the side length of the triangle:[1]
A closely related problem is to cover the equilateral triangle with a fixed number of equal circles, having as small a radius as possible.[6]
See also
- Circle packing in an isosceles right triangle
- Malfatti circles, three circles of possibly unequal sizes packed into a triangle











