Wednesday, 16 September 2015

modular arithmetic - How to calculate 52003 mod 13


How to calculate 52003 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

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...