Binomial (Properties of Coefficients)

Click For Summary

Homework Help Overview

The discussion revolves around a summation involving binomial coefficients, specifically the expression \(\sum^{n}_{r=0} (2r+1) (^{n} C_{r})^{2}\). Participants are exploring properties of these coefficients and their relation to polynomial identities.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants are attempting to manipulate the given summation using polynomial expressions and differentiation. Questions arise regarding the next steps after establishing a polynomial form and the nature of the problem itself.

Discussion Status

Some participants have suggested specific values for \(n\) to simplify the problem and focus efforts. Others are exploring the implications of replacing variables and the combinatorial interpretations of the coefficients involved. There is an ongoing exploration of different approaches without a clear consensus on a method or solution.

Contextual Notes

Participants note that the original problem may require proving equivalences to multiple expressions involving binomial coefficients, and there is mention of a textbook answer that prompts further inquiry into the proof process.

ritwik06
Messages
577
Reaction score
0

Homework Statement


[tex]\sum^{n}_{r=0} (2r+1) (^{n} C_{r})^{2}[/tex]


The Attempt at a Solution


[tex]x(1+x^{2})^{n}[/tex]
If I differentiate this and put x=1;
I will get the above series without the squares of the binomial coefficients.Will multiplying by [tex](1+x)^{n}[/tex] help now?
 
Physics news on Phys.org
The "problem" you give is a polynomial. Now, what are you supposed to do with it? What is the question?
 
I have to prove this equal to anyone of these.
[tex] a) (2n+2) ^{2n} C_{n} [/tex]

[tex] b) (n+1) ^{2n} C_{n} [/tex]

[tex] c) (2n+1) ^{2n} C_{n} [/tex]

[tex] d) (n) ^{2n} C_{n}[/tex]
 
Last edited:
Help me!
 
Well to make things easier (and to cheat a little), let n=2, for example. You should find that only (b) holds. Now of course a proof is required, so that itself doesn't count. But at least you know where to focus your effort.
 
Defennder said:
Well to make things easier (and to cheat a little), let n=2, for example. You should find that only (b) holds. Now of course a proof is required, so that itself doesn't count. But at least you know where to focus your effort.

The answer was already given to me in the textbook. I am just wondering how to prove the result...
 
Roughly the same trick as the other one. Replace r in 2r+1 by n-r. As for C(n,r)^2, That's the same as C(n,r)*C(n,n-r). If you sum of over r, isn't that the same as the number of ways to choose n objects from a group of 2n objects?
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K