How to calculate $5^{2003}$ mod $13$
using fermats little theorem
5^13-1 1 mod 13
(5^12)^166+11 mod 13
a+b modn=(a modn + b modn) modn
(1+11mod13)mod13
12 mod 13 = 12
why answer is 8 ?
how do we calculate this
thanks
Subscribe to:
Post Comments (Atom)
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I am asked to prove the density of irrationals in $\mathbb{R}$. I understand how to do this by proving the density of $\mathbb{Q}$ first, na...
-
Can someone just explain to me the basic process of what is going on here? I understand everything until we start adding 1's then after ...
No comments:
Post a Comment