Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

MRITuhin's blog

Prime Test
By MRITuhin, history, 9 years ago, In English

We know that if n is prime, then:

{a^(n-1)} mod n = 1 [Fermat primality test]

Can anyone explain its mathematical proof?

  • Vote: I like it
  • -17
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
9 years ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

https://en.wikipedia.org/wiki/Proofs_of_Fermat%27s_little_theorem

→ Reply
»
9 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by MRITuhin (previous revision, new revision, compare).

→ Reply