Weber problem that, at the optimum, the angles between the AD, BD, and CD straight lines must be equal to 360° / 3 = 120°. Torricelli deduced from that conclusion that: 1– if any triangle ABD, whose ∠ADB angle is equal to 120°, generates an ABDE convex quadrilateral inscribed in a circle, the ∠ABE angle of the ABE triangle must be equal to (180° − 120°)= 60°; 2– one way to determine the set of locations of D for which the ∠ADB angle is equal to 120° is to draw an equilateral ABE triangle (because each angle of an equilateral triangle is
Circle packing in an equilateral triangle 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