Prove that (2p p)≡2(mod p^3), where p>=5 is a prime number.

Brodie Beck

Brodie Beck

Answered question

2022-09-06

Prove that ( 2 p p ) 2 ( mod p 3 ) , where p 5 is a prime number.

Answer & Explanation

cisalislewagobc

cisalislewagobc

Beginner2022-09-07Added 8 answers

This congruence identity can be generalized as follows:
( a p b p ) ( a b ) ( mod p 3 ) ,
where p is a prime number and a , b are positive integers. The combinatorial proof of it can be reduce to the case a = 2 , b = 1.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?