Fermat's Little Theorem



  Def :

Let p be prime number , a belongs to integers , and 

p doesn't divide a . Then

a^p-1 = 1 (mod p)

Post a Comment

Please Select Embedded Mode To Show The Comment System.*

Previous Post Next Post