I'm stuck with the following question
Show that for each positive integer b,
Thank you for your help
Hello,
You can take a look at the Chinese remainder theorem , as far as i see your problem, this is the only way i've found to get only elements of solution...
If you were asked to show that it had a congruence with 1 mod 1001, i would have given you Euler's theorem
oO is a smiley
That's the problem, the initial text said that it was for any integer... I couldn't verify with my calculator, thanks
This implication seems odd to me. I don't see with which theorem/property we can say it (although i agree with the result )Thus.
.