k = 1 ∑ 3 2 n 3 + 8 n + 5 0 − 1 i k
Let n denote a positive integer, and for i = − 1 , evaluate the summation above for all n .
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.
Nice problem, but anyone can guess the solution because we have 3 attemptions.
It could be 1 , − 1 , i , − i or 0 , you can't enter i or − i as answer so. :D
Log in to reply
But probability that your answer is correct at first attempt is 3 1 :).
Log in to reply
Good point. I've added an MCQ format to this question.
Log in to reply
@Brilliant Mathematics – Thank you it is better.
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 + 5 0 − 1 ≡ ( − 1 ) 2 ( n 3 + 4 n + 2 5 ) − 1 ≡ 1 n 3 + 4 n + 2 5 − 1 ( m o d 4 )
Now, we note that ∀ n ∈ Z + , we have n 3 + 4 n + 2 5 ∈ Z + and hence, we have,
3 2 n 3 + 8 n + 5 0 − 1 ≡ 1 − 1 ≡ 0 ( m o d 4 )
using the fact that 1 x = 1 ∀ x ∈ Z + .
Log in to reply
That's right.But that time Euler came in my mind so is Euler's theorem.
Problem Loading...
Note Loading...
Set Loading...
3 2 n 3 + 8 n + 5 0 − 1 = 3 2 ( n 3 + 4 n + 2 5 ) − 1 = 3 2 y − 1
By Euler's theorem we know that 3 2 y − 1 ≡ 0 mod 4 .
⇒ 3 2 n 3 + 8 n + 5 0 − 1 = 4 z
It is known that sum of 4 consecutive powers of i results in 0 .
Therefore our answer is Aryabhata's invention or 0 .