Find a square number such that, when a given integer is added or subtracted, new square numbers are obtained so that
(1)
|
and
(2)
|
This problem was posed by the mathematicians Théodore and Jean de Palerma in a mathematical tournament organized by Frederick II in Pisa in 1225. The solution (Ore 1988, pp. 188-191) is
(3)
| |||
(4)
|
where and are integers. and are then given by
(5)
| |||
(6)
|
Fibonacci proved that all numbers (the congrua) are divisible by 24. Fermat's right triangle theorem is equivalent to the result that a congruum cannot be a square number.
A table for small and is given in Ore (1988, p. 191), and a larger one (for ) by Lagrange (1977). The first