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 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 in the top left corner: Beginning programmers are often assigned the task of writing a program to print out the table in the format shown. The numbers along the left edge of the triangle are the lazy caterer's sequence and the numbers along the right edge are the triangular numbers. The "n"th row sums to "n"("n" + 1)/2, the constant