Prove that for every positive integer the equation
has at least non-negative integer solutions .
Solution
Consider equation: (*).
We have the following remarks:
Remark 1: If is a non-negative integer solution of (*) for , , then is a non-negative integer solution of (*) for .
Remark 2: For each , equation (*) always has 1 non-negative integer solution , with odd. (Below such a solution will be called odd-solution).
Proof: We shall prove by induction in .
Since the claim is valid for .
Assume that the claim is valid for , , we will show its validity for .
Indeed, let be an odd-solution of (*) for . Then, by means of the equality
and
the pairs and are non-negative integer solution of (*) for .
Moreover, since is odd, one of the two integers and has to be odd. Consequently, one of the above two solution of (*) for has to be odd. That is what to be proved.
Since , is a solution of (*) for . Hence, by means of Remarks 1 and 2, an easy induction show that for each , equation (*) always has at least non-negative integer solution .