An algebra problem by U.N. Owen

Algebra Level 4

The value of n n , such that j = 1 n ( 1 + i ) j = 31 + i \displaystyle\sum _{ j=1 }^{ n }{ (1+i)^{ j } } =31+i , being i i defined as the imaginary unit, is

Even, below 10 Prime, above 8 Odd, below 7 A multiple of 9

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.

2 solutions

j = 1 n ( 1 + i ) j = ( 1 + i ) [ ( 1 + i ) n 1 ] ( 1 + i ) 1 = ( 1 + i ) [ ( 1 + i ) n 1 ] i = i ( 1 + i ) [ ( 1 + i ) n 1 ] = ( 1 i ) [ ( 1 + i ) n 1 ] = ( 1 i ) ( 1 + i ) n 1 + i = ( 1 i 2 ) ( 1 + i ) n 1 1 + i = 2 ( 1 + i ) n 1 1 + i \begin{aligned} \sum_{j=1}^n (1+i)^j & = \frac{(1+i)[(1+i)^n-1]}{(1+i)-1} \\ & = \frac{(1+i)[(1+i)^n-1]}{i} \\ & = -i(1+i)[(1+i)^n-1] \\ & = (1-i)[(1+i)^n-1] \\ & = (1-i)(1+i)^n-1+i \\ & = (1-i^2)(1+i)^{n-1}-1+i \\ & = 2(1+i)^{n-1}-1+i \end{aligned}

31 + i = 2 ( 1 + i ) n 1 1 + i 2 ( 1 + i ) n 1 1 = 31 2 ( 1 + i ) n 1 = 32 ( 1 + i ) n 1 = 16 Since ( 1 + i ) 2 = 2 i ( 2 i ) n 1 2 = 2 4 2 n 1 i n 1 = 2 8 2 8 i 8 = 2 8 i 8 = 1 n 1 = 8 n = 9 – a multiple of 9 \begin{aligned} \Rightarrow 31 + i & = 2(1 +i)^{n-1}-1+i \\ 2(1+i)^{n-1}-1 & = 31 \\ 2(1+i)^{n-1} & = 32 \\ (1+i)^{n-1} & = 16 \quad \quad \small \color{#3D99F6}{\text{Since } (1+i)^2 = 2i} \\ \Rightarrow (2i)^{\frac{n-1}{2}} & = 2^4 \\ 2^{n-1}i^{n-1} & = 2^8 \\ 2^8i^8 & = 2^8 \quad \quad \small \color{#3D99F6}{i^8=1} \\ \Rightarrow n-1 & = 8 \\ n & = 9 \space \boxed{\text{-- a multiple of 9}} \end{aligned}

There's no need to use the "e power i pi" thing as it's more complicated than necessary.

You have 2 ( 1 + i ) n 1 1 = 31 ( 1 + i ) n 1 = 16 2(1+i)^{n-1} - 1 = 31 \Rightarrow (1+i)^{n-1} = 16 . Note that ( 1 + i ) 2 = 2 i (1+i)^2 = 2i , so the previous equation is equivalent to ( 2 i ) ( n 1 ) / 2 = 2 4 (2i)^{(n-1)/2} = 2^4 or 2 n 1 × i n 1 = 2 8 2^{n-1} \times i^{n-1} = 2^8 . So n 1 = 8 n -1 =8 and n 1 n-1 is divisible by 4. Solving it gives n = 9 n=9 only.

Pi Han Goh - 5 years, 9 months ago

Log in to reply

Thanks. I have changed the solution.

Chew-Seong Cheong - 5 years, 9 months ago

I am unable to post questions. But I have one please post the solutions. The number of ordered pair of positive integers (m,n) satisfying M<=2n<=60,n<=2m<=60 is A)240 B)480 c)900 d) none Ans is unknown to me.

Shyambhu Mukherjee - 5 years, 8 months ago

Log in to reply

Click this .

Pi Han Goh - 5 years, 8 months ago
Kay Xspre
Sep 8, 2015

Use the formula for geometric progression that S n = a 1 ( r n 1 ) r 1 S_n = \frac{a_{1}(r^{n}-1)}{r-1} to which in this question, a 1 = r = 1 + i a_{1}=r=1+i . Plugging in the value gives S n = ( 1 + i ) ( ( 1 + i ) n 1 ) ( 1 + i ) 1 S_n = \frac{(1+i)((1+i)^{n}-1)}{(1+i)-1} or more simply ( 1 + i ) n + 1 + ( i 1 ) = 31 + i (1+i)^{n+1}+(i-1) = 31+i , which may be simplified to ( 1 + i ) n + 1 = 32 (1+i)^{n+1} = 32

From here we can use the properties of the absolute value, and by plugging in gives ( 1 + i ) n + 1 = 32 |(1+i)^{n+1}| = |32| , or more simply ( 2 ) n + 1 = 32 (\sqrt{2})^{n+1} = 32 . Solve for n n gives n = 9 n = 9

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...