Combinatorics and alternating series

Click For Summary

Homework Help Overview

The problem involves proving a combinatorial identity related to alternating series and binomial coefficients using induction. The specific identity to prove is a summation that alternates signs based on the index of the binomial coefficient.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the application of the binomial coefficient identity and express uncertainty about handling the alternating signs in the series. Some participants suggest rewriting the identity in different forms to facilitate the proof.

Discussion Status

There is an ongoing exploration of the problem, with participants offering hints and suggestions for rewriting the identity. Some participants have pointed out potential issues with the original statement, and others are considering different approaches to the induction process.

Contextual Notes

One participant notes that the statement may be incomplete, and there is discussion about the complexity of using induction on different variables. The conversation reflects a mix of ideas on how to approach the proof without reaching a definitive conclusion.

QuantumP7
Messages
66
Reaction score
0

Homework Statement



Prove that

[tex]1 - \dbinom{n}{1}\ + \dbinom{n}{2} \ - \dbinom{n}{3} \ + \cdots \ + (-1)^r \dbinom{n}{r} = (-1)^r \dbinom{n - 1}{r}[/tex]

by induction.


Homework Equations





The Attempt at a Solution


Well, I know how to solve the normal binomial sums by using the identity [tex]\dbinom{n}{r} \ = \dbinom{n - 1}{r} \ + \dbinom{n - 1}{r - 1}[/tex]. I'm just not sure what to do with the (-1) part. I can't find any example of an inductive proof using an alternating series anywhere, that does not involve the convergence test. Could anyone give me a hint as to where to go with this problem?
 
Last edited:
Physics news on Phys.org
QuantumP7 said:
Prove that

[tex]1 - \dbinom{n}{1}\ + \dbinom{n}{2} \ - \dbinom{n}{3} \ + \cdots + (-1)^r \ \dbinom{n - 1}{r}[/tex]

by induction.

This statement is incomplete as written.
 
I'm SO sorry! I fixed it. Thank you for pointing this out!
 
It might make it easier to write the identity as
[tex](-1)^r \dbinom{n - 1}{r} = \sum_{k=0}^r (-1)^{r-k} \begin{pmatrix} n \\ r-k \end{pmatrix}.[/tex]I'm not sure yet if the recursive formula is any easier than the factorial formula. It might help to use both at some point.
 
Well, for n + 1, would the equation be

[tex]1 - \dbinom{n}{1} + \dbinom{n}{2} \ - \dbinom{n}{3} + \cdots + (-1)^{r - 1 }<br /> \dbinom{n}{r} + (-1)^r \dbinom{n + 1}{r}[/tex] ?
 
QuantumP7 said:
Well, for n + 1, would the equation be

[tex]1 - \dbinom{n}{1} + \dbinom{n}{2} \ - \dbinom{n}{3} + \cdots + (-1)^{r - 1 }<br /> \dbinom{n}{r} + (-1)^r \dbinom{n + 1}{r}[/tex] ?

No, for n+1, just shift [tex]n\rightarrow n+1[/tex] everywhere in the equation in the OP. Induction on n is trivial because you can just multiply through the equation for n by a certain set of factors to show that the (n+1) equation is true. The trickier part is induction on r. It looks like using that series just makes things harder though, so forget that I wrote that and use the recursion formula in the equation for r. You should be able to rearrange things to get the equation for (r+1).
 
Oh, I see. Thank you SO much! I wish I could give you some points or something for your help!
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 18 ·
Replies
18
Views
5K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 17 ·
Replies
17
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K