← fundamentals / Posts tagged 'number-theory' Posts tagged 'number-theory' F.33 Euclidean (m, n) Generators For integers m > n >= 1, Euclid’s quadratic generators a = m^2 - n^2, b = 2 m n, and c = m^2 + n^2 satisfy a^2 + b^2 = c^2 and inradius r = n(m - n).
F.33 Euclidean (m, n) Generators For integers m > n >= 1, Euclid’s quadratic generators a = m^2 - n^2, b = 2 m n, and c = m^2 + n^2 satisfy a^2 + b^2 = c^2 and inradius r = n(m - n).
