Integer triangle common divisor. Integer triangles with a 60° angle can also be generated by with coprime integers "m", "n" with 0 < "n" < "m" (the angle of 60° is opposite to the side of length "a"). From here, all primitive solutions can be obtained by dividing "a", "b", and "c" by their greatest common divisor (e.g. an equilateral triangle solution is obtained by taking "m" = 2 and "n" = 1, but this produces "a" = "b" = "c" = 3, which is not a primitive solution). See also More precisely, If formula_109, then formula_110, otherwise formula_111. Two different pairs
Circle packing in an equilateral triangle 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: A closely related problem is to cover the equilateral triangle with a fixed number of equal circles, having as small a radius as possible. 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