Problem: Optimally pack *n* unit circles into the smallest possible equilateral triangle.

Let *L(n)* denote the length of the side of the smallest equilateral triangle in which *n* circles have been packed optimally. This number is, in general, unknown.

### Like this:

Like Loading...

*Related*

Pingback: Simple unsolved math problem, 4 | Guzman's Mathematics Weblog