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 group is Euclidean if the angle sum is exactly π, spherical if it exceeds π and hyperbolic if it is strictly smaller than π. Moreover, any two triangles with the given angles are congruent. Each triangle group determines a tiling, which is conventionally colored in two colors, so that any two adjacent tiles have opposite colors. In terms of the numbers "l", "m", "n" > 1 there are the following possibilities. formula_4 The triangle group is the infinite symmetry group of a certain tessellation (or tiling) of the Euclidean plane by triangles whose angles add up to π (or 180°). Up