Saturday, March 3, 2018

discrete mathematics - How to compute 32003pmod99 by hand?





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 351(mod11), so 320001(mod11), and therefore 320033327(mod11). This is already congruent to 0 modulo 9, so we are finished.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...