MHB Combinatoric Proof: n Choose 2 Choose 2 = 3 (n+1) Choose 4

  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Proof
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Show that $${{n\choose 2}\choose 2 }=3 {n+1\choose 4}$$
 
Mathematics news on Phys.org
I would expect some one to solve combinatorically but I provide algebragically
writing (n k) for nCk

We have (n 2) = n(n-1)/2

So ((n 2) 2) = ((n(n-1)/2) (n(n-1)/2-1))/2
= n(n-1)/2 ( n^2-n -2)/ 4
= n(n-1)(n-2)(n+1)/8
= 3( n(n-1)(n-2)(n+1)/24
= 3 ( n+1)!/(4!(n+1-4)! Multiply numerator and dnominator by (n-3)!
= 3 (n + 1 4)
 
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...
Back
Top