Solutions are given here for finding sets of three numbers such
that the sum of any two of them is a perfect square. Can you
generalize the methods to find sets of four numbers with this
property?
Hyeyoun Chung from
St Paul's Girls' School noticed that if the square numbers chosen
are:
,
and
and the corresponding set of
three integers are
and
, with
and:
then these these three equations can be solved to give:
Therefore, from a single square number,
, three integers
,
and
can be found with values such that the sum of any pair
of these numbers is a perfect square. The only problem with this
system is, however, that the square number must be even, otherwise
,
and
will not be integers.
Yatir Halevi tackled the problem as follows:
We are given 3 square numbers:
and
, and we have
to find a general formula for finding 3 integers that are 'Pair
Squares' such that the sum of any pair is a square number, that
is:
,
and
.
Solving for
and
we get:
By the same methods we get:
In order for
and
to be integers; either
and
are all even or two are odd and the other is even because if
an integer
is even or odd so is its square. This is proved as
follows: if
is odd then it can be written
, so
which is odd. If
is
even then
, so
which is even.
For the first case we can generate Pair Squares by choosing any
three even squares, for example 4, 16 and 36 and the formula
gives:
This is a set of pair squares because
,
and
.
For the second case we can generate Pair Squares by choosing any
two odd squares together with one even square, for example 9, 1
and 4 and the formula gives:
Checking that this is a set of pair squares we have
.
As for four integers that are pair squares: take an even square
and halve it and you have
giving
for example
or
.
Saul Foresta used a similar method and gave the following example:
,
and