Hi, I've to solve the following diophantine equation (in positive integers):
.
Thanks for any help.
The solution is![]()
Take modulowe have
otherwise if
is odd we have
which is impossible .
Thus we have
which leads to
where
which is the multiple of
if
which is again impossible .
Thus( not
because
) but they can't be both zero as we are looking for positive integers
![]()
We now show thatis the only solution .
Supposeso we have
If we write down the first six powers ofmodulo
, we obtain :
we have exactlyand exactly
We conclude thatfor some non-negative integers
Back to this equation :
writewe have
the multiple of
which is also impossible .
Therefore ,
is the only hope , luckily , we obtain
and
,
is the only solution .