Integer triangle formula_112 and formula_113 generate the same triple. Unfortunately the two pairs can both be of gcd=3, so we can't avoid duplicates by simply skipping that case. Instead, duplicates can be avoided by formula_27 going only till formula_115. Note that we still need to divide by 3 if gcd=3. The only solution for formula_116 under the above constraints is formula_117 for formula_118. With this additional formula_119 constraint all triples can be generated uniquely. An Eisenstein triple is a set of integers which are the lengths of the sides of a triangle where one of the angles is 60 degrees. Integer triangles
Triangle of the lengths of any two sides of a triangle must be greater than or equal to the length of the third side. That sum can equal the length of the third side only in the case of a degenerate triangle, one with collinear vertices. It is not possible for that sum to be less than the length of the third side. A triangle with three given positive side lengths exists if and only if those side lengths satisfy the triangle inequality. Three given angles form a non-degenerate triangle (and indeed an infinitude of them) if and only if both