#Combinatorics
30 messages · Page 1 of 1 (latest)
What do you understand? What have you tried?
I think it can be solved by binomial expansion
I've tried to reach to the left side of the equations by expanding (x+y)^n.
I've also tried to prove it for a determined value for n (for example n = 4 or n = 5). it seems right but don't know where to start the proof
The title says combinatorial proof. Do you just mean that the topic is combinatorics, or do you actually need a combinatorial proof?
Expanding it would work, but that would give you an algebraic proof. (It's also much harder.)
The combinatorial method is to pose a new question that is answered by both sides of the equation, and therefore they must be the same.
It's my mistake I could use a better topic
I meant the topic is combinatorics
Oh. So you haven't learned combinatorial proofs?
Combinatorics
Heh, I just noticed the typo that the sum should be k=1.
Yep, you're right let me close the post re-post with the right equations
it's right equations
\sum_{k=0}^{n}\binom{n}{k}\binom{2n}{k}=\binom{3n}{n}
Soroosh
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
Oh, the typo doesn't matter, lol
I understood the question without even noticing
To do this algebraically, you need to write binom(n,k) using factorials
Same with the other one
I've tried it.
it's get really messy by proving in form factorials and hard to follow
Show your work
I rewrite it, it seems it leads me to a really messy equations which is hard to simplify. and it if continue the factorial farther and taking common denominator and .... it really get messy (really no space will be left on the whiteboard, lol)
One of those should be 2n-k
yeah you're right i made a mistake let me retry it
I'm not sure that expansion the sum with a ... is helpful
This algebra is really messy and I'm not sure how it's going to get better... That could just be a blind spot on my part
ThankU
it really get worse after i fix the mistake:))
let me try if binomial theorem can help
I'm really surprised that you haven't learnt combinatorial proofs. This is a classic one. The combinatorial proof is two lines.
Can you introduce text book on it? I haven't seen anything about it in the book that professor uses as the reference