Divisibilityhard
0:00.0
Prove that if n > 4 is composite, then (n-1)! ≡ 0 (mod n). Which step is most important?
Prove that if n > 4 is composite, then (n-1)! ≡ 0 (mod n). Which step is most important?
Prove that if n > 4 is composite, then (n-1)! ≡ 0 (mod n). Which step is most important?