Solution Found!
Prove that if p is a prime number and r is an integer with
Chapter 5, Problem 79E(choose chapter or problem)
QUESTION:
Prove that if p is a prime number and r is an integer with 0 < r < p, then \(\left(\begin{array}{l} p \\ r \end{array}\right)\) is divisible by p.
Text Transcription:
(_r^p)
Questions & Answers
QUESTION:
Prove that if p is a prime number and r is an integer with 0 < r < p, then \(\left(\begin{array}{l} p \\ r \end{array}\right)\) is divisible by p.
Text Transcription:
(_r^p)
ANSWER:Solution :
Step 1 :
In this problem we have to prove that is divisible by .
Given that is prime number and
is an integer and .
Consider