Reuleaux triangle any curve of given constant width. This area is where "s" is the constant width. One method for deriving this area formula is to partition the Reuleaux triangle into an inner equilateral triangle and three curvilinear regions between this inner triangle and the arcs forming the Reuleaux triangle, and then add the areas of these four sets. At the other extreme, the curve of constant width that has the maximum possible area is a circular disk, which has area formula_2. The angles made by each pair of arcs at the corners of a Reuleaux triangle are all equal to 120°.
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