Iota Terminator

Algebra Level 3

k = 1 3 2 n 3 + 8 n + 50 1 i k \Large \sum_{k=1}^{3^{2n^3+8n+50} - 1} i^k

Let n n denote a positive integer, and for i = 1 i = \sqrt{-1} , evaluate the summation above for all n n .

This problem is original.

i i -1 0 1 i -i

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Shivamani Patil
Jun 29, 2015

3 2 n 3 + 8 n + 50 1 = 3 2 ( n 3 + 4 n + 25 ) 1 = 3 2 y 1 { 3 }^{ 2n^{ 3 }+8n+50 }-1={ 3 }^{ 2(n^{ 3 }+4n+25) }-1={ 3 }^{ 2y }-1\quad

By Euler's theorem we know that 3 2 y 1 0 { 3 }^{ 2y }-1\equiv 0\quad mod 4 4 .

3 2 n 3 + 8 n + 50 1 = 4 z \Rightarrow { 3 }^{ 2n^{ 3 }+8n+50 }-1=4z

It is known that sum of 4 4 consecutive powers of i i results in 0 0 .

Therefore our answer is Aryabhata's invention or 0 0 .

Nice problem, but anyone can guess the solution because we have 3 attemptions.

It could be 1 1 , 1 -1 , i i , i -i or 0 0 , you can't enter i i or i -i as answer so. :D

Вук Радовић - 5 years, 11 months ago

Log in to reply

But probability that your answer is correct at first attempt is 1 3 \frac { 1 }{ 3 } :).

shivamani patil - 5 years, 11 months ago

Log in to reply

Good point. I've added an MCQ format to this question.

Brilliant Mathematics Staff - 5 years, 11 months ago

Log in to reply

@Brilliant Mathematics Thank you it is better.

shivamani patil - 5 years, 11 months ago

You don't really need Euler's Theorem here. It can be done using basic modular arithmetic as follows:

3 2 n 3 + 8 n + 50 1 ( 1 ) 2 ( n 3 + 4 n + 25 ) 1 1 n 3 + 4 n + 25 1 ( m o d 4 ) 3^{2n^3+8n+50}-1\equiv (-1)^{2(n^3+4n+25)}-1\equiv 1^{n^3+4n+25}-1\pmod{4}

Now, we note that n Z + \forall~n\in\Bbb{Z^+} , we have n 3 + 4 n + 25 Z + n^3+4n+25\in\Bbb{Z^+} and hence, we have,

3 2 n 3 + 8 n + 50 1 1 1 0 ( m o d 4 ) 3^{2n^3+8n+50}-1\equiv 1-1\equiv 0\pmod{4}

using the fact that 1 x = 1 x Z + 1^x=1~\forall~x\in\Bbb{Z^+} .

Prasun Biswas - 5 years, 11 months ago

Log in to reply

That's right.But that time Euler came in my mind so is Euler's theorem.

shivamani patil - 5 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...