# Converting Sigma notation....

by Pranav-Arora
Tags: converting, notation, sigma
HW Helper
P: 6,164
 Quote by Pranav-Arora I like Serena said that define a function of x and integrate it but i still don't get how he got x2k?
I defined an arbitrary function s(x) that looks a bit like your problem with the special property that if you substitute x=1, it is identical to your problem.

It's a trick to solve your problem.

The choice of the power 2k was inspired so that the factor (2k+1) would disappear during integration.
P: 3,060
 Quote by I like Serena I defined an arbitrary function s(x) that looks a bit like your problem with the special property that if you substitute x=1, it is identical to your problem. It's a trick to solve your problem. The choice of the power 2k was inspired so that the factor (2k+1) would disappear during integration.
Ok i got it!!
But how i would integrate the expression. It involves sigma notation and i have never done integration of any expression which involves sigma notation.
HW Helper
P: 6,164
 Quote by Pranav-Arora Ok i got it!! But how i would integrate the expression. It involves sigma notation and i have never done integration of any expression which involves sigma notation.
So write out the terms of the summation, do the integration, and combine the resulting terms back into sigma notation.
P: 3,060
 Quote by I like Serena So write out the terms of the summation, do the integration, and combine the resulting terms back into sigma notation.
I did as you said. After integrating, i got
$$x+nx^3+\frac{n(n-1)x^5}{2!}+\frac{n(n-1)(n-2)x^7}{3!}........x^{2n+1}$$

Now what should i do next?
 HW Helper P: 3,324 To be frank, I have never answered such questions myself either, but I took I like Serena's advice and it worked out wonderfully. We'll start again just to make things clear, To solve $$\sum_{k=0}^{n}(2k+1)^{n}C_k$$ we define a function $$f(x)=\sum_{k=0}^{n}(2k+1){^n}C_kx^{2k}$$ we make it x2k because the integral of that is $\frac{x^{2k+1}}{2k+1}$ and notice how that denominator will cancel with the (2k+1) factor in the original question. So we have, $$\int{f(x)dx}=\sum_{k=0}^{n}{^n}C_kx^{2k+1}$$ And here is the tricky part, we need to convert the right side into a binomial expression using the formula $$\sum_{k=0}^{n}{^n}C_ka^kb^{n-k}=(a+b)^n$$ It is clear that the b is again missing, which it is just hidden as b=1, but we need to convert the x2k+1 in such a way that it is equivalent to ak. Use your rules for indices to convert it in such a way.
 HW Helper P: 3,324 What might have been easier for you is you could've split the summation into $$2\sum k{^n}C_k+\sum {^n}C_k$$ and then defined $$s(x)=2\sum k{^n}C_kx^{k+1}+\sum {^n}C_kx^{k+1}$$
HW Helper
P: 6,164
 Quote by Pranav-Arora I did as you said. After integrating, i got $$x+nx^3+\frac{n(n-1)x^5}{2!}+\frac{n(n-1)(n-2)x^7}{3!}........x^{2n+1}$$ Now what should i do next?

$$\sum_{k=0}^n {^n}C_k (2k+1) x^{2k} = {^n}C_0 + {^n}C_1 \cdot 3 x^2 + {^n}C_2 \cdot 5 x^4 + ... + {^n}C_k (2k + 1) x^{2k} + ...$$

Integration would give:
$${^n}C_0 \cdot x + {^n}C_1 \cdot x^3 + {^n}C_2 \cdot x^5 + ... + {^n}C_k x^{2k+1} + ...$$

Converting back to sigma notation:
$$\sum_{k=0}^n {^n}C_k x^{2k+1}$$
P: 3,060
 Quote by Mentallic To be frank, I have never answered such questions myself either, but I took I like Serena's advice and it worked out wonderfully. We'll start again just to make things clear, To solve $$\sum_{k=0}^{n}(2k+1)^{n}C_k$$ we define a function $$f(x)=\sum_{k=0}^{n}(2k+1){^n}C_kx^{2k}$$ we make it x2k because the integral of that is $\frac{x^{2k+1}}{2k+1}$ and notice how that denominator will cancel with the (2k+1) factor in the original question. So we have, $$\int{f(x)dx}=\sum_{k=0}^{n}{^n}C_kx^{2k+1}$$ And here is the tricky part, we need to convert the right side into a binomial expression using the formula $$\sum_{k=0}^{n}{^n}C_ka^kb^{n-k}=(a+b)^n$$ It is clear that the b is again missing, which it is just hidden as b=1, but we need to convert the x2k+1 in such a way that it is equivalent to ak. Use your rules for indices to convert it in such a way.
Would it be like this (x2k+1+1)n.
P: 3,060
 Quote by I like Serena Hmm, what I intended was this: $$\sum_{k=0}^n {^n}C_k (2k+1) x^{2k} = {^n}C_0 + {^n}C_1 \cdot 3 x^2 + {^n}C_2 \cdot 5 x^4 + ... + {^n}C_k (2k + 1) x^{2k} + ...$$ Integration would give: $${^n}C_0 \cdot x + {^n}C_1 \cdot x^3 + {^n}C_2 \cdot x^5 + ... + {^n}C_k x^{2k+1} + ...$$ Converting back to sigma notation: $$\sum_{k=0}^n {^n}C_k x^{2k+1}$$
I did the same way.
HW Helper
P: 3,324
 Quote by Pranav-Arora Would it be like this (x2k+1+1)n.
Noo...

$$\sum{^n}C_kx^k1^{n-k}=(x+1)^n$$

and not $$(x^k+1)^n$$

Use the fact that

$$a^{b+1}=a\cdot a^b$$ and $$a^{2b}=\left(a^2\right)^b$$
P: 3,060
 Quote by Mentallic Noo... $$\sum{^n}C_kx^k1^{n-k}=(x+1)^n$$ and not $$(x^k+1)^n$$ Use the fact that $$a^{b+1}=a\cdot a^b$$ and $$a^{2b}=\left(a^2\right)^b$$
I tried it but got stuck again. I did it like this:-

$$x^{2k+1}=x^{2k}.x=(x^2)^k.x$$

HW Helper
P: 3,324
 Quote by Pranav-Arora I tried it but got stuck again. I did it like this:- $$x^{2k+1}=x^{2k}.x=(x^2)^k.x$$
Why did you get stuck? That's exactly what it should be!

So now we have

$$\int{f(x)dx}=\sum_{k=0}^{n}{^n}C_kx\cdot \left(x^2\right)^k$$

And since x is independent of k, it can move out the front of the summation, so we have

$$x\sum_{k=0}^{n}{^n}C_k\left(x^2\right)^k1^{n-k}$$

And now apply the formula to convert it into a binomial. And since you need to find f(1), take the derivative of both sides to get the expression for f(x).
P: 3,060
 Quote by Mentallic Why did you get stuck? That's exactly what it should be! So now we have $$\int{f(x)dx}=\sum_{k=0}^{n}{^n}C_kx\cdot \left(x^2\right)^k$$ And since x is independent of k, it can move out the front of the summation, so we have $$x\sum_{k=0}^{n}{^n}C_k\left(x^2\right)^k1^{n-k}$$ And now apply the formula to convert it into a binomial. And since you need to find f(1), take the derivative of both sides to get the expression for f(x).
If i convert it into binomial, i get
$$x.(x^2+1)^n$$

I substitute the value 1 and i get
$$2^n$$

But then how i would find out the derivative??
Do i have to first take the derivative and substitute the value 1?
HW Helper
P: 6,164
 Quote by Pranav-Arora If i convert it into binomial, i get $$x.(x^2+1)^n$$
Good!

 Quote by Pranav-Arora But then how i would find out the derivative?? Do i have to first take the derivative and substitute the value 1?
Yep!
HW Helper
P: 3,324
 Quote by Pranav-Arora But then how i would find out the derivative?? Do i have to first take the derivative and substitute the value 1?
Yep, that's what I meant by

 Quote by Mentallic And since you need to find f(1), take the derivative of both sides to get the expression for f(x).

You're nearly there!
 P: 3,060 Thanks!! I think that this time i am right. I took the derivative and found it to be $$2nx(x^2+1)^{n-1}$$ Now i substituted the value 1 and i got:- $$2n.2^{n-1}$$ Right...?
 HW Helper P: 6,164 No, not quite. What you have is not the derivative of $x.(x^2+1)^n$. You need to apply the so called product rule. That is: (u v)' = u' v + u v' And you have to apply the so called chain rule. That is: (u(v))' = u'(v) v' Are you familiar with those rules?
 P: 3,060 I am not familiar with the product rule but when i calculated the derivative on Wolfram, it was the same as i got?

 Related Discussions General Math 6 Calculus & Beyond Homework 1 Precalculus Mathematics Homework 4 Calculus & Beyond Homework 2 Calculus & Beyond Homework 16