This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
Definitely, you can approach it via @Incredible Mind's Method but I would like to share another method.
We can proceed by using Euler's Formula
eix=cosx+isinx⇒cosx=2eix+e−ix
Thus, setting x=n2kπ, we can compute the sum as follows:
k=1∑n−1(n−k)cosn2kπ===k=1∑n−1(n−k)2ein2kπ+e−in2kπ2nk=1∑n−1(ein2kπ+e−in2kπ)−21k=1∑n−1k(ein2kπ+e−in2kπ)2nk=1∑n−1(ein2kπ+e−in2kπ)−21k=1∑n−1k(ein2kπ+e−in2kπ)
Now that above series (the first sum) is a simple Geometric Expansion and the second one can be obtained by differentiating the first one.
(Hint : ∑r=1nxr=x−1x(xn−1) and ∑r=1nrxr=(x−1)2x+(nx−n−1)xn+1)
Finally, it evaluates to
k=1∑n−1(n−k)cosn2kπ=2n(−2)−21(−n)=−2n
(I urge the reader to verify the above result themselves)
EDIT : A general approach for finding the sum of series of type ∑k=1nkrk (doesn't involves differentiation)
Let Sn=k=1∑nkrk=r+2r2+3r3+…+nrn
Then observing closely
SnrSn==r+2r2+3r3+…+nrnr2+2r3+…+(n−1)rn+nrn+1
Subtracting the second series from second one, we get
To distinguish the 2 approaches, you should explain that the second summation can be obtained by methods other than differentiation, especially since Omkar said he doesn't know differentiation.
This is a useful formula to be aware of, to sum scenarios like this.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Definitely, you can approach it via @Incredible Mind's Method but I would like to share another method.
We can proceed by using Euler's Formula eix=cosx+isinx ⇒cosx=2eix+e−ix
Thus, setting x=n2kπ, we can compute the sum as follows:
k=1∑n−1(n−k)cosn2kπ===k=1∑n−1(n−k)2ein2kπ+e−in2kπ2nk=1∑n−1(ein2kπ+e−in2kπ)−21k=1∑n−1k(ein2kπ+e−in2kπ)2nk=1∑n−1(ein2kπ+e−in2kπ)−21k=1∑n−1k(ein2kπ+e−in2kπ) Now that above series (the first sum) is a simple Geometric Expansion and the second one can be obtained by differentiating the first one. (Hint : ∑r=1nxr=x−1x(xn−1) and ∑r=1nrxr=(x−1)2x+(nx−n−1)xn+1)
Finally, it evaluates to k=1∑n−1(n−k)cosn2kπ=2n(−2)−21(−n)=−2n (I urge the reader to verify the above result themselves)
EDIT : A general approach for finding the sum of series of type ∑k=1nkrk (doesn't involves differentiation)
Let Sn=k=1∑nkrk=r+2r2+3r3+…+nrn
Then observing closely
SnrSn==r+2r2+3r3+…+nrnr2+2r3+…+(n−1)rn+nrn+1
Subtracting the second series from second one, we get
(1−r)Sn=(r+r2+r3+…+rn)−nrn+1=1−rr(1−rn)−nrn+1 ⇒Sn=(1−r)2r(1−rn)−1−rnrn+1
I hope that helps :)
Log in to reply
Oh okay. Thanks!
To distinguish the 2 approaches, you should explain that the second summation can be obtained by methods other than differentiation, especially since Omkar said he doesn't know differentiation.
This is a useful formula to be aware of, to sum scenarios like this.
Log in to reply
ok sir, I'll edit my solution, right now. :)
split it .then 1st can be known by using complex numbers.2nd sum from differentiation of
S=sinx+sin2x+sin3x...sin(n-1)x.........use the sum formula .then diff. w.r.t x both sides.then sub x=2pi/n.
i cannot type because i dont know LATEX
Log in to reply
Oh okay, but I don't know about differentiation. Is there any other method? I think complex numbers come handy.
Log in to reply
But there too you need to use differentiation.
Anyways, I'll definitely think of some another approach which doesn't involves differentiation.