show that \[(1+x)^{n}=\sum_{k=0}^{n}\left(\begin{matrix}n \\ k\end{matrix}\right)x^{k}\]for any nonnegative integer \(n\) and deduce \[(a+b)^{n}=\sum_{k=0}^{n}\left(\begin{matrix}n \\ k\end{matrix}\right)a^{k}b^{n-k}\]for any \(a\), \(b\)
lol, show that a binomial expansion is a binomial expansion? i assume we have to do induction
I forgot to add this:\[\left(\begin{matrix}n \\ k\end{matrix}\right)=\frac{ n! }{ k!(n-k)! }\]
how would i go about proving this with induction?
since 0 is a nonnegative integer, so start with n=0 as a basis.
ok let me try with that
i'm kind of confused when i try to do the summation of \[\left(\begin{matrix}0 \\ k\end{matrix}\right)\] form 0 to 0?
\[(1+x)^0=\binom 00x^0\]
ok this holds then. sorry i'm sort of slow
if its already know that \[\lim_{x\to -1}(1+x)^0=1\]then we dont have to prove it works for all values of x do we?
now that we know its true for n=0, redefine it for some n=t in the setup
ok and i assume that n=k is true, and then i use n=t+1 to see if it was true, right?
i had a pretty little latex going, but as for par the google snapped on it
we cant use k again since its already part of the setup, so I picked n=t
multiply both sides by (1+x) so that the left side is (1+x)^t (1+x) = (1+x)^(t+1)
we wil need to transform the right side into a t+1 format ... since its the format thats is true for n=0
ok here's what I have:\[(1+x)\sum_{k=0}^{t}\left(\begin{matrix}t \\ k\end{matrix}\right)x^k=\sum_{k=0}^{t+1}\left(\begin{matrix}t+1 \\ k\end{matrix}\right)x^k\]and i don't know if that's right?
you havent proved it, youve just made a bold assumption at this point
ok i see. what should my next step be then?
distribute it thru .... (1+x) sum[0,t] (t k) x^k sum[0,t] (t k) x^k + sum[0,t] (t k) x^(k+1) we need to get both exponents to agree, and we do that by bumping the index by +1
sum[0,t] (t k) x^k + sum[1,t+1] (t k-1) x^k
did you make the new k=k+1 in the second term there?
if i latex this thing will crash again ...
it's ok i'm following. thanks
now i have\[(1+x)^{t+1}=\sum_{k=0}^{t}\left(\begin{matrix}t \\ k\end{matrix}\right)x^k+\sum_{k=1}^{t+1}\left(\begin{matrix}t \\ k-1\end{matrix}\right)x^k\]
\[(1+x)\sum_{k=0}^{t}\binom tk x^k\] \[\sum_{k=0}^{t}\binom tk x^k+x\sum_{k=0}^{t}\binom tk x^k\] \[\sum_{k=0}^{t}\binom tk x^k+\sum_{k=0}^{t}\binom tk x^{k+1}\] \[\sum_{k=0}^{t}\binom tk x^k+\sum_{k=1}^{t+1}\binom t{k-1} x^{k-1+1}\] \[\sum_{k=0}^{t}\binom tk x^k+\sum_{k=1}^{t+1}\binom t{k-1} x^{k}\]
take out a k=0 from the left, and a k=t+1 from the right ...
\[1+\sum_{k=1}^{t}\binom tk x^k+\sum_{k=1}^{t}\binom t{k-1} x^{k}+\binom t{t+1-1} x^{t+1}\]
now we can merge the summation notations and work on them
ok let me try
I got\[1+\sum_{k=1}^{t}\left[ \left(\begin{matrix}t \\ k\end{matrix}\right) +\left(\begin{matrix}t \\ k-1\end{matrix}\right)\right]x^k+x^{t+1}\]
and i already proved the identity (n,k-1)+(n,k)=(n+1,k) previously, so i can make that (t+1,k).
good, now simplify those binomials into something useful
good
but i'm still left with the 1 and the \(x^{t+1}\), do i just add them back so the summation would be k=0 and t+1?
lol, why should I let you be deprived of the joy of discovery :) try them out
i know the 1 can go back but i don't know how to make the \(x^{t+1}\) go back
try the middle for k = t+1, does it produce the x^(t+1)?
yes! lol thanks it's right before my eyes
thank you so much!
youre welcome :)
how do i say that it deduces that a,b relationship though?
you essentially would use that process as the backbone, and replace 1+x with a+b
ok
im not really sure why they dont just have you run the process with a=b from the start
er, a+b
let 1=a, let x=b ...
lol. thank you so much. i have more problems but i'll try them myself first.
thank you so much i panicked when i saw the summation symbol
good luck ;) you might have to finagel it a little to get the final results, but it should go pretty smooth
thanks. i have more proof problems. if i don't get it, can i ask for your help again? it's a real analysis problem book.
if im around .. prolly got about an hour or so before I have to head home and be bored
ok i'll open a new problem because i had been thinking about this one for a wekk and can't figure it out
Join our real-time social learning platform and learn together with your friends!