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
Heronian triangle sides is an irrational number, no equilateral triangle is Heronian. However, there is a unique sequence of Heronian triangles that are "almost equilateral" because the three sides are of the form "n" − 1, "n", "n" + 1. A method for generating all solutions to this problem based on continued fractions was described in 1864 by Edward Sang, and in 1880 Reinhold Hoppe gave a closed-form expression for the solutions. The first few examples of these almost-equilateral triangles are listed in the following table : Subsequent values of "n" can be found by multiplying the previous value by 4, then