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
Well, I not sure if this is better or not. But....
Let f(n)=∣j=1∑njij∣
Then by trial and error, we have
f(3)=f(4)=22,f(7)=f(8)=42,f(11)=f(12)=62
This suggests that f(2k−1)=f(2k)=k2 for some positive integer k>1. I'm not sure I can prove this rigorously. Induction perhaps? Still thinking.
With that, we get k=18⇒2k−1=35,2k=36⇒n=35,36
On the other hand, since we have a scalar multiple of 2 on RHS, this suggests that ∣Re(i+2i2+3i3+…+nin)∣=∣Im(i+2i2+3i3+…+nin)∣. Not sure how to continue...
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
Given ∣i+2i2+3i3+…+nin∣=182
i+2i2+3i3+…+nin
=(i+i2+i3+…+in)
+ (i2+i3+…+in)
+ (i3+…+in)
…
+ (in)
=i−1i(in−1)+i−1i2(in−1−1)+i−1i3(in−2−1)+…+i−1in(i1−1)
=i−11[i(in−1)+i2(in−1−1)+i3(in−2−1)+…+in−1(i2−1)+in(i−1)]
=i−11[n in+1−i−1i(in−1)]
=(i−11)2[(i−1)n in+1−i(in−1)]
=21[−n in+1+in(n+1)−1]
Case I: n(mod4)=0⇒in+1=i, in=1
⇒−n in+1+in(n+1)−1=n−ni
⇒∣−n in+1+in(n+1)−1∣=n2+n2
⇒362=n2+n2⇒n=36
Case II: n(mod4)=1⇒in+1=−1, in=i
Solve this the same way and it yields no integer solution
Case III: n(mod4)=2⇒in+1=−i, in=−1
Likewise. No integer solution.
Case IV: n(mod4)=3⇒in+1=1, in=−i
Likewise, we get n=35
Hence, n=35,36
Log in to reply
Too lengthy , I also tried in the same way, but is there any short trick?.Otherwise your solution is nice....
Log in to reply
Well, I not sure if this is better or not. But....
Let f(n)=∣j=1∑nj ij∣
Then by trial and error, we have
f(3)=f(4)=22, f(7)=f(8)=42, f(11)=f(12)=62
This suggests that f(2k−1)=f(2k)=k2 for some positive integer k>1. I'm not sure I can prove this rigorously. Induction perhaps? Still thinking.
With that, we get k=18⇒2k−1=35,2k=36⇒n=35,36
On the other hand, since we have a scalar multiple of 2 on RHS, this suggests that ∣Re(i+2i2+3i3+…+nin)∣=∣Im(i+2i2+3i3+…+nin)∣. Not sure how to continue...
Log in to reply
S=i+2i2+3i3+...+nin...(1)
A shorter way: LetiS=i2+2i3....+(n−1)in+nin+1...(2)
Subtracting terms having same power of i in (1) and (2)...
We have S(1−i)=i+i2+i3...in−nin+1
After this applying formula for sum of G.P.
S(1−i)=1−ii(1−in)−nin+1
⇒S=(1−i)2i(1−in)−1−inin+1
Then the cases that you told... thanks for the cases. They just didnt come to my mind.
Log in to reply
Hey.. I think (i−1)21=2i?
You wrote −21..
Log in to reply
Oh man I'm horrible in spotting my own mistakes... Thanks!
Hey man, good solution!! When I first saw the problem I also thought about the many sums of APs, but I definitely did not know how to work on it.