Fermat's Little Theorem states that (acc to Gallian book)
apmodp=amodp.
Does it mean that we get the same remainder when both ap and a are divided by some prime p? I am quite confused about this statement. Through wikipedia,
I read ap≡amodp. Kindly help. I am new to this number system topic.
Answer
apmodp≡amodp⟹ap−a≡0modp⟹pdivides(ap−a)⟹ap−a=kp⟹ap=kp+a
So what is the remainder when ap is divided by p
No comments:
Post a Comment