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.
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.
You must be logged in to post a comment.