Fermat's right triangle theorem is, by the Pythagorean theorem, they would form two integer-sided right triangles in which the pair formula_10 gives one leg and the hypotenuse of the smaller triangle and the same pair also forms the two legs of the larger triangle. But if (as Fibonacci asserted) no square congruum can exist, then there can be no two integer right triangles that share two sides in this way. Because the congrua are exactly the numbers that are four times the area of a Pythagorean triangle, and multiplication by four does not change whether a number is square, the existence of a square
Floyd's triangle of an "n" × "n" magic square . Summing up the row sums in Floyd's triangle reveals the doubly triangular numbers (triangular numbers with an index that is triangular) 1 = 1 = T(T(1)) <br><br><br> 1 = 6 = T(T(2)) <br> 2 + 3 <br><br><br> 1 <br> 2 + 3 = 21 = T(T(3))<br> 4 + 5 + 6 <br> Floyd's triangle Floyd's triangle is a right-angled triangular array of natural numbers, used in computer science education. It is named after Robert Floyd. It is defined by filling the rows of the triangle with consecutive numbers, starting with a 1