MHB How Does Modulo Arithmetic Prove a Combinatorial Identity Involving Primes?

  • Thread starter Thread starter evinda
  • Start date Start date
AI Thread Summary
The discussion focuses on proving the combinatorial identity involving primes, specifically that for a prime \( p \neq 2 \) and \( 0 \leq k \leq p-1 \), the equation \( \binom{p-1}{k} \equiv (-1)^k \pmod p \) holds true. The user explores the calculation of \( \binom{p-1}{k} \) using Wilson's theorem, which states that \( (p-1)! \equiv -1 \pmod p \). They derive that \( \binom{p-1}{k} \) can be expressed in terms of factorials and ultimately simplify it to show the equivalence to \( (-1)^k \). The conversation concludes with positive affirmation of the proof's validity.
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hey again! (Blush)

If $p \neq 2$ is a prime and $0 \leq k \leq p-1, \text{ prove that: }$
$$\binom{p-1}{k} \equiv (-1)^k \pmod p$$

I thought that I could calculate $\binom{p-1}{k}k!$ :

$$\binom{p-1}{k}k!=\frac{(p-1)!}{k!(p-(k+1))!}k!=\frac{(p-1)!}{(p-(k+1))!}$$

According to Wilson's theorem, $(p-1)! \equiv -1 \pmod p$..
But...what is equal $\mod p$ to $(p-(k+1))!$ ? (Thinking)
 
Last edited:
Mathematics news on Phys.org
evinda said:
Hey again! (Blush)

If $p \neq 2$ is a prime and $0 \leq k \leq p-1, \text{ prove that: }$
$$\binom{p-1}{k} \equiv (-1)^k \pmod p$$

I thought that I could calculate $\binom{p-1}{k}k!$ :

$$\binom{p-1}{k}k!=\frac{(p-1)!}{k!(p-(k+1))!}k!=\frac{(p-1)!}{(p-(k+1))!}$$

According to Wilson's theorem, $(p-1)! \equiv -1 \pmod p$..
But...what is equal $\mod p$ to $(p-(k+1))!$ ? (Thinking)

Could I show it maybe like that?

$$ \binom{p-1}{k}=\frac{(p-1)!}{k!(p-(k+1))!}=\frac{(p-k)(p-k+1) \cdots (p-1)}{k!} \equiv \frac{(p-1) \cdots (p-k+1)(p-k)}{k!} \equiv \frac{(-1) \cdots (-k+1)(-k)}{k!} \equiv \frac{(-1)^k k!}{k!} \equiv (-1)^k \pmod p $$ ?
(Nerd)
 
evinda said:
Could I show it maybe like that?

$$ \binom{p-1}{k}=\frac{(p-1)!}{k!(p-(k+1))!}=\frac{(p-k)(p-k+1) \cdots (p-1)}{k!} \equiv \frac{(p-1) \cdots (p-k+1)(p-k)}{k!} \equiv \frac{(-1) \cdots (-k+1)(-k)}{k!} \equiv \frac{(-1)^k k!}{k!} \equiv (-1)^k \pmod p $$ ?
(Nerd)

Looks good! (Nod)
 
I like Serena said:
Looks good! (Nod)

Nice,thank you very much! (Happy)
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Is it possible to arrange six pencils such that each one touches the other five? If so, how? This is an adaption of a Martin Gardner puzzle only I changed it from cigarettes to pencils and left out the clues because PF folks don’t need clues. From the book “My Best Mathematical and Logic Puzzles”. Dover, 1994.
Thread 'Imaginary Pythagoras'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top