Friday, April 14, 2017

modular arithmetic - Calculate 2000! (mod 2003)

Calculate 2000! (mod 2003)



This can easily be solved by programming but is there a way to solve it, possibly with knowledge about finite fields? (2003 is a prime number, so mod(2003) is a finite field) .



As much details as possible please, I want to actually understand.

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...