Compute 32003(mod99) by hand?
It can be computed easily by evaluating 32003, but it sounds stupid. Is there a way to compute it by hand?
Answer
I would calculate separately modulo 9 and 11 and put the pieces together at the end.
Modulo 9 is trivial, we get 0.
Note that 35≡1(mod11), so 32000≡1(mod11), and therefore 32003≡33≡27(mod11). This is already congruent to 0 modulo 9, so we are finished.
No comments:
Post a Comment