A community for students.
Here's the question you clicked on:
 0 viewing
Mimi_x3
 4 years ago
Prove:
\[\binom{n1}{k1}
+\binom{n2}{k1}
+\binom{n3}{k1}
+....+\binom{k1}{k1}
=\binom{n}{k}\]
Mimi_x3
 4 years ago
Prove: \[\binom{n1}{k1} +\binom{n2}{k1} +\binom{n3}{k1} +....+\binom{k1}{k1} =\binom{n}{k}\]

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0i will guess induction

Mimi_x3
 4 years ago
Best ResponseYou've already chosen the best response.1induction? is there by chance another method?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0maybe a thinking method, but i can't imagine there is another way, since you are making a statement that says essentially "for all \(n\in \mathbb{N}\) this formula holds"

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0the last part will be some annoying algebra with factorials, but since you have a sum with \(nk\) terms you cannot add them i in a formula that i can think of. i think the induction step will be enough arithmetic as it is

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0for base case it is probably easiest to start at \(n=2\)

Mimi_x3
 4 years ago
Best ResponseYou've already chosen the best response.1can it be a gemoetric progression?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0maybe, lets try it with numbers , say \(n=5, k=3\) then \(\dbinom{2}{2}=1,\dbinom{3}{2}=3, \dbinom{4}{2}=6\) no, not geometric

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0there is a think a way to do it by thinking, however it is almost like saying \[\dbinom{n}{k}=\dbinom{n1}{k}+\dbinom{n1}{k1}\]

Mimi_x3
 4 years ago
Best ResponseYou've already chosen the best response.1hm..so induction is the only method? but i havent learnt induction to prove these kind of things..

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0You can just keep using:\[\left(\begin{matrix}n \\ k\end{matrix}\right)=\left(\begin{matrix}n1 \\ k\end{matrix}\right)+\left(\begin{matrix}n1 \\ k1\end{matrix}\right)\]over and over again. In a sense, its an inductive argument. Using it once gives you the above statement. Notice the second part of the sum is something you want, but not the first part. So use that idea on the first one again:\[\left(\begin{matrix}n1 \\ k\end{matrix}\right)=\left(\begin{matrix}n2 \\ k\end{matrix}\right)+\left(\begin{matrix}n2 \\ k1\end{matrix}\right)\]So altogether we have:\[\left(\begin{matrix}n \\ k\end{matrix}\right)=\left(\begin{matrix}n2 \\ k\end{matrix}\right)+\left(\begin{matrix}n2 \\ k1\end{matrix}\right)+\left(\begin{matrix}n1 \\ k1\end{matrix}\right)\]Again, the last two parts of the sum are what you want, but the first isnt, so keep repeating this process (this is the inductive reasoning). You do this all the way until the n2 on the top becomes k1.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.