Answer Happy • 4. Prove that if p is an odd prime and m is an integer satisfying 1≤m≤p-1, then (P-¹)-(- m - (-1) = 0 (mod p), where (P-

Page 1 of 1

4. Prove that if p is an odd prime and m is an integer satisfying 1≤m≤p-1, then (P-¹)-(- m - (-1) = 0 (mod p), where (P-

Posted: Mon Jul 11, 2022 12:07 pm

by answerhappygod

: 4 Prove That If P Is An Odd Prime And M Is An Integer Satisfying 1 M P 1 Then P M 1 0 Mod P Where P 1 (32.3 KiB) Viewed 60 times

4. Prove that if p is an odd prime and m is an integer satisfying 1≤m≤p-1, then (P-¹)-(- m - (-1) = 0 (mod p), where (P-¹) is the binomial coefficient. m