Proving (a+b)^n = ∑(n_μ)(a^μ)(b^(n-μ)) | a=1, b=-1 using Sequences Test

  • Thread starter Thread starter AnthonyAcc
  • Start date Start date
  • Tags Tags
    Sequences Test
Click For Summary

Homework Help Overview

The discussion revolves around proving the identity \((a+b)^{n} = \sum_{k=0}^{n} \binom{n}{k} a^{k} b^{n-k}\) for specific values of \(a\) and \(b\) (namely \(a=1\) and \(b=-1\)). Participants are exploring the implications of this identity and its application to sequences and sums.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss the manipulation of binomial coefficients and the implications of substituting values for \(a\) and \(b\). There are attempts to separate sums based on parity (odd/even) and questions about the limits of summation, particularly regarding the transition from infinite to finite sums.

Discussion Status

The discussion is active with various approaches being considered. Some participants are questioning the assumptions behind the use of infinite sums and the properties of binomial coefficients, while others are suggesting specific forms for the sums to explore the identity further.

Contextual Notes

There are mentions of constraints related to the definitions of binomial coefficients, particularly regarding their behavior when the upper index is less than the lower index. Additionally, there is uncertainty about the necessity of starting with an infinite sum in this context.

AnthonyAcc
Messages
5
Reaction score
0
Show that ([tex]^{n}_{n}[/tex]) - ([tex]^{n}_{n-1}[/tex]) + ([tex]^{n}_{n-2}[/tex]) - ([tex]^{n}_{n-3}[/tex]) + ...([tex]^{n}_{0}[/tex]) = 0

(a+b)[tex]^{n}[/tex] = [tex]\sum^{\infty}_{\nu=0}[/tex] ([tex]^{n}_{\nu}[/tex])a[tex]^{\nu}[/tex]b[tex]^{n-\nu}[/tex]a=1
b=-1

0 = (1+(-1))[tex]^{n}[/tex] = [tex]\sum^{\infty}_{\nu=0}[/tex]([tex]^{n}_{\nu}[/tex]) 1[tex]^{\nu}[/tex](-1)[tex]^{n-\nu}[/tex] = [tex]\sum^{\infty}_{\nu=0}[/tex]([tex]^{n}_{\nu}[/tex])(-1)[tex]^{n-\nu}[/tex] =

...I don't know what to do here...

= [tex]\sum^{n}_{\nu=0}[/tex]([tex]^{n}_{n-\nu}[/tex])(-1)[tex]^{\nu}[/tex] = ([tex]^{n}_{n}[/tex]) - ([tex]^{n}_{n-1}[/tex]) + ([tex]^{n}_{n-2}[/tex]) - ([tex]^{n}_{n-3}[/tex]) + ...([tex]^{n}_{0}[/tex])That is if that last equality is correct and makes sense to be there.

Any suggestions?

Also, how can I make it so everything that follows the Sigma doesn't look like it is being superscripted?

Thanks!
 
Last edited:
Physics news on Phys.org
a=1, b=-1
(1+(-1))n=0

Now try a=-1, b=1 so that

(-1+1)n=0

Or separate the odds from the even and create two separate sums:
sum (even) - sum (odd) = 0
 
Does this [tex]\sum[/tex][tex]^{\infty}_{\nu=0}[/tex] ([tex]^{n}_{\nu}[/tex]) imply [tex]\sum[/tex][tex]^{n}_{\nu=0}[/tex] ([tex]^{n}_{\nu}[/tex]) because it's for every n choose [tex]\nu[/tex] so there can only be n many [tex]\nu[/tex]s?
 
I told you to use something like this:
[tex]\sum_{v=0}^{n/2}\binom{n}{n-2v}(-1)^{2v}*1^{n-2v}+\sum_{v=0}^{n/2}\binom{n}{n-2v-1}(-1)^{2v-1}*1^{n-2v-1}[/tex]

For the both sums a=-1 and b=1, so that 0-0=0

Use \binom{ } { } for binomial coefficients.

Regards.
 
Last edited:
A more fundamental question I have, I guess, is if I know that [tex]\sum[/tex][tex]^{\infty}_{\nu=0}[/tex] ([tex]^{n}_{\nu}[/tex]) a[tex]^{\nu}[/tex] b[tex]^{n-\nu}[/tex] = (a+b)[tex]^{n}[/tex] then do I know that
[tex]\sum[/tex][tex]^{n}_{\nu=0}[/tex] ([tex]^{n}_{n-\nu}[/tex]) a[tex]^{\nu}[/tex] b[tex]^{n-\nu}[/tex] = (a+b)[tex]^{n}[/tex]? How does the changing of infinity to n and the [tex]\nu[/tex] to n - [tex]\nu[/tex] impact the series?
 
Last edited:
n is an integer, right? Then the generalized binomial coefficient C(n,nu) of n and nu is zero for nu>n, also right? There's a zero factor in the definition. That's how you truncate the infinite sum. Though I'm not sure why you have an infinite sum to begin with. And in that case, sure, C(n,nu)=C(n,n-nu).
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K