Circle packing in an equilateral triangle
Circle packing in an equilateral triangle is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest possible equilateral triangle. Optimal solutions are known for n < 13 and for any triangular number of circles, and conjectures are available for n < 28.
A conjecture of Paul Erdős and Norman Oler states that, if is a triangular number, then the optimal packings of and of circles have the same side length: that is, according to the conjecture, an optimal packing for circles can be found by removing any single circle from the optimal hexagonal packing of circles. This conjecture is now known to be true for.
Minimum solutions for the side length of the triangle:
| Number of circles | Is triangular | Length | Area |
| 1 | True | = 3.464... | 5.196... |
| 2 | False | = 5.464... | 12.928... |
| 3 | True | = 5.464... | 12.928... |
| 4 | False | = 6.928... | 20.784... |
| 5 | False | = 7.464... | 24.124... |
| 6 | True | = 7.464... | 24.124... |
| 7 | False | = 8.928... | 34.516... |
| 8 | False | = 9.293... | 37.401... |
| 9 | False | = 9.464... | 38.784... |
| 10 | True | = 9.464... | 38.784... |
| 11 | False | = 10.730... | 49.854... |
| 12 | False | = 10.928... | 51.712... |
| 13 | False | = 11.406... | 56.338... |
| 14 | False | = 11.464... | 56.908... |
| 15 | True | = 11.464... | 56.908... |
A closely related problem is to cover the equilateral triangle with a fixed number of equal circles, having as small a radius as possible.
