How does $ \binom{n}{k} $ 'n choose k' get involved with coefficient of $ (a+b)^n $. Is there any intuitive geometrical picture (interpretation) that it seems obvious?
$\begingroup$
$\endgroup$
6
-
1$\begingroup$ This question seems to be related: Binomial Coefficients in the Binomial Theorem - Why Does It Work Question $\endgroup$– Martin SleziakJun 11, 2012 at 13:03
-
$\begingroup$ Ah thanks ... !! i guess it's exactly what i'm looking for $\endgroup$– S LJun 11, 2012 at 13:04
-
3$\begingroup$ Picture an $n$-dimensional cube (that is the hard part) with side length $a + b$ and divide it up... this is not easy to do beyond $n = 3$ but it is a good exercise anyway. $\endgroup$– Qiaochu YuanJun 11, 2012 at 14:07
-
$\begingroup$ How do I divide it?? .. i mean how many smaller cubes am i going to have?? $\endgroup$– S LJun 11, 2012 at 17:01
-
2$\begingroup$ There is a very good picture under "geometric explanation" in the Wikipedia article on the binomial theorem here: en.wikipedia.org/wiki/Binomial_theorem $\endgroup$– Jair TaylorJun 14, 2012 at 19:01
|
Show 1 more comment
3 Answers
$\begingroup$
$\endgroup$
1
Hint: Imagine writing $(a+b)^n$ as $(a+b)(a+b)\dots(a+b)$, and then multiplying out all the brackets. Ask yourself how many ways you can get a term involving $a^kb^{n-k}$.
-
$\begingroup$ thanks ... !! it's a lot more intuitive than comparing pascal's triangle $\endgroup$– S LJun 11, 2012 at 13:07
$\begingroup$
$\endgroup$
Expanding on what Old John wrote, it might help to consider a "noncommutative" version of the binomial theorem. $(a+b)^n = (a+b)(a+b)...(a+b)$ is going to have $2^n$ terms. Each of the $2^n$ words of length $n$ consisting of the letters $a$ and $b$ will occur exactly once. If you identify words via commutativity of multiplication, you will see there are $\binom{n}{k}$ words in the equivalence class of $a^{n-k}b^k$.
$\begingroup$
$\endgroup$
Here is how you visualize binomial theorem https://upload.wikimedia.org/wikipedia/commons/4/47/Binomial_theorem_visualisation.svg
