Proof. Consider the sequence
defined by
where
are the roots of the polynomial
.
Then
, and
thus for all
,
therefore, by adding these two relations, we obtain
This shows that for all
,
is an integer.
Suppose that
is odd. Since
,
So
, thus
and
, therefore
Then
, so
This shows that for all
,
After some experiments, we found the following pattern, which we will prove by induction:
-
If
,
so
This shows that
is true.
-
Suppose now that
is true. In particular,
where
are odd integers. Then by (1),
where
is odd. Therefore
Similarly,
where
is odd. Therefore
Now
where
, where
is the sum of three odd numbers, so
is odd. Thus
where
is odd. Therefore
Finally
where
is odd. Therefore
To summarize,
so
is true when
is true.
-
The induction is done, so
In particular, for all integers
,
In both cases,
If
,
is divisible by
but not by
. □