Summing up binomial coefficients

AI Thread Summary
The discussion focuses on simplifying a complex expression involving binomial coefficients. Participants suggest expanding squares and using specific values for n to identify patterns. They emphasize the symmetry and properties of binomial coefficients, recommending the creation of a cheat sheet for reference. Additionally, they propose using cube roots of unity to analyze the behavior of the series. The conversation highlights the challenge of simplifying the second series while building on the first series simplification.
utkarshakash
Gold Member
Messages
852
Reaction score
13

Homework Statement


The value of ((^n C_0+^nC_3+...) - \frac{1}{2} (^nC_1+^nC_2+^nC_4+^nC_5+...))^2 + \frac{3}{4} (^nC_1-^nC_2+^nC_4-^nC_5...)^2<br />


The Attempt at a Solution


I can see that in the left parenthesis, the first bracket contains terms which are multiples of 3 and in the second bracket, those terms are missing. I know it's a much less attempt from my part but that's all I can see. Please help XO
 
Physics news on Phys.org
Sums go to n?
Have you tried expanding out the squares?
You'll need extra binomial coefficients.

The coefficients have a symmetry amongst other properties - you should make a cheat-sheet of the basic properties.

Also - try n=2 and n=3 and expand them out explicitly and see if you find a pattern.

BTW: what was the question?
 
Try using powers of a cube root of 1. E.g. look at how the imaginary parts of those change and compare it with the behaviour of the last series.
 
haruspex said:
Try using powers of a cube root of 1. E.g. look at how the imaginary parts of those change and compare it with the behaviour of the last series.

I could simplify the first series to
'\dfrac{(\omega ^2n + \omega ^n)^2}{4}

But I still can't get the second one. Here's my attempt

(1+\omega)^n + (1+ \omega ^2)^n = 2(C_0+C_3+...) - (C_1+C_2+C_4...)
 
utkarshakash said:
I could simplify the first series to
'\dfrac{(\omega ^2n + \omega ^n)^2}{4}

But I still can't get the second one. Here's my attempt

(1+\omega)^n + (1+ \omega ^2)^n = 2(C_0+C_3+...) - (C_1+C_2+C_4...)

Consider other linear combinations of (1+1)n, (1+ω)n, (1+ω2)n.
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks
Back
Top