Prove that if p is a prime number and r is an integer with

Chapter 5, Problem 79E

(choose chapter or problem)

Get Unlimited 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)

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

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back