150 Omg!

Algebra Level 5

a 1 n + a 2 n + a 3 n + a 4 n + a 5 n + a 6 n + a 7 n a_1 ^n + a_2 ^n + a_3 ^n + a_4 ^n + a_5 ^n + a_6 ^n + a_7 ^n

For positive integer n n , denote S n S_n as the value of the above expression, where a 1 , a 2 , a 3 , a 4 , a 5 , a 6 , a 7 a_1, a_2, a_3, a_4, a_5, a_6, a_7 are complex numbers.

Given that S 1 = S 2 = S 3 = S 4 = S 5 = 0 S_1 = S_2 = S_3 = S_4 = S_5 = 0 , S 6 = 12 S_6 = 12 , and cyclic a 1 a 2 a 3 a 4 a 5 a 6 = 2 \displaystyle \sum_{\text{cyclic}} a_1 a_2 a_3 a_4 a_5 a_6 = -2

Find the value of x x if S 150 = 12 x S_{150} = 12x .


The answer is 16777216.

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

Sakanksha Deo
Mar 19, 2015

Newton's sum,

Let

a 1 a 2 = P 2 \large \displaystyle\sum{a_1 a_2} = P_2

a 1 a 2 a 3 = P 3 \large \displaystyle\sum{a_1 a_2 a_3} = P_3

.

.

a 1 a 2 a 3 a 3 a 4 a 5 a 6 a 7 = P 7 \large a_1 a_2 a_3 a_3 a_4 a_5 a_6 a_7 = P_7

S 2 = S 1 2 2 P 2 P 2 = 0 \large S_2 = S_1^2 - 2 P_2 \Rightarrow P_2 = 0

Now,

S 3 = S 1 S 2 P 2 S 1 + 3 P 3 P 3 = 0 \large S_3 = S_1 S_2 - P_2 S_1 + 3 P_3 \Rightarrow P_3 = 0

S 4 = S 1 S 3 P 2 S 2 + P 3 S 1 4 P 4 P 4 = 0 \large S_4 = S_1 S_3 - P_2 S_2 + P_3 S_1 - 4 P4 \Rightarrow P_4 = 0

S 5 = S 1 S 4 P 2 S 3 + P 3 S 2 P 4 S 1 + 5 P 5 P 5 = 0 \large S_5 = S_1 S_4 - P_2 S_3 + P_3 S_2 - P_4 S_1 + 5 P_5 \Rightarrow P_5 = 0

S 6 = S 1 S 5 P 2 S 4 + P 3 S 3 P 4 S 2 + P 5 S 1 6 P 6 = 12 = 2 1 × 6 \large S_6 = S_1 S_5 - P_2 S_4 + P_3 S_3 - P_4 S_2 + P_5 S_1 - 6 P_6 = 12 = 2^1 \times 6

S 11 = S 1 S 10 P 2 S 9 + P 3 S 8 + P 4 S 7 P 5 S 6 + P 6 S 5 P 7 S 4 = 0 \large S_{11} = S_1 S_{10} - P_2 S_9 + P_3 S_8 + P_4 S_7 - P_5 S_6 + P_6 S_5 - P_7 S_4 = 0

S 12 = S 1 S 11 P 2 S 10 + P 3 S 9 P 4 S 8 + P 5 S 7 P 6 S 6 + P 7 S 5 = 24 = 2 2 × 6 \large S_{12} = S_1 S_{11} - P_2 S_{10} + P_3 S_9 - P_4 S_8 + P_5 S_7 - P_6 S_6 + P_7 S_5 = 24 = 2^2 \times 6

S 18 = S 1 S 17 P 2 S 16 + P 3 S 15 P 4 S 14 + P 5 S 13 P 6 S 12 + P 7 S 11 = 48 = 2 3 × 6 \large S_{18} = S_1 S_{17} - P_2 S_{16} + P_3 S_{15} - P_4 S_{14} + P_5 S_{13} - P_6 S_{12} + P_7 S_{11} = 48 = 2^3 \times 6

Now, notice that

S 6 n = 2 n × 6 \large S_{6n} = 2^n \times 6

Therefore,

S 150 = S 6 × 25 = 2 25 × 6 = 201326592 \large S_{150} = S_{ 6 \times 25 } = 2^{25} \times 6 = 201326592

So,

x = 201326592 12 = \large x = \frac{201326592}{12} = 16777216 \boxed{16777216}

You need to prove that S 6 n = 2 n × 6 S_{6n} = 2^n \times 6

Pi Han Goh - 6 years, 2 months ago

Log in to reply

It can easily be observed that it's in that sequence..

Sakanksha Deo - 6 years, 2 months ago

Log in to reply

You only showed that for it's true for n = 1 , 2 , 3 n = 1,2,3 . You need a rigorous proof of that.

Pi Han Goh - 6 years, 2 months ago

Log in to reply

@Pi Han Goh Since S 1 = P 2 = P 3 = P 4 = P 5 = 0 S_1 = P_2 = P_3 = P_4 = P_5 = 0

So, only S 6 n S_{6n} and S 7 n S_{7n} will have non zero values.

Also every S 6 n S_{6n} can be evaluated by just multipliting S 6 ( n 1 ) S_{6(n-1) } to - P 6 P_6 Or in simple sense,

S 6 n = S 6 ( n 1 ) × ( P 6 ) = S 6 ( n 1 ) × 2 S_{6n} = S_{6(n-1) } \times ( - P_6 )= S_{6(n-1) } \times 2

I think this should be enough

Sakanksha Deo - 6 years, 2 months ago

Log in to reply

@Sakanksha Deo Yes, you easily get interesting conclusions by observation from this since you get the following recurrence after a bit of work:

P i = 2 P i 6 + e 7 P i 7 i 7 , P 0 = 7 P_i=2P_{i-6}+e_7P_{i-7}~\forall~i\geq 7~,~P_0=7

By Newton's Identities, it can be trivially shown that,

x Z 5 + , P x = 0 e x = 0 \forall~x\in\Bbb{Z_{\leq 5}^+}~,~P_x=0\implies e_x=0

P x = e x = 0 x Z 5 + { P i = 0 i ≢ 0 ( m o d 6 , 7 ) P i = 2 P i 6 i 0 ( m o d 6 ) P i = e 7 P i 7 i 0 ( m o d 7 ) \because P_x=e_x=0~\forall~x\in\Bbb{Z_{\leq 5}^+}\implies \begin{cases}P_i=0~\forall~i\not\equiv 0\pmod{6,7}\\P_i=2P_{i-6}~\forall~i\equiv 0\pmod6\\ P_{i}=e_7P_{i-7}~\forall~i\equiv 0\pmod7\end{cases}

where i Z + i\in\Bbb{Z^+} . So, you get, with a bit of recurrence solving,

P i = { 2 ( i 6 ) / 6 × P 6 = 12 × 2 ( i 6 ) / 6 i 0 ( m o d 6 ) e 7 ( i 7 ) / 7 × P 7 = e 7 ( i 7 ) / 7 × 7 e 7 = 7 × e 7 i / 7 i 0 ( m o d 7 ) P_i=\begin{cases}2^{(i-6)/6}\times P_6=12\times 2^{(i-6)/6}~\forall~i\equiv 0\pmod6\\ e_7^{(i-7)/7}\times P_7=e_7^{(i-7)/7}\times 7e_7=7\times e_7^{i/7}~\forall~i\equiv 0\pmod7\end{cases}

This is, in no way, a nice rigorous proof. Although, a more rigorous proof can be provided, I guess. If anyone wants, I'll try to post a more rigorous proof later here as a comment or as a separate note.

If we knew the value of e 7 e_7 , we could've given a simple closed form result for P 7 n P_{7n} values too that relied simply on n n .


Clarifications:

  • P i P_i and e i e_i notation in my comment is the same as S i S_i and P i P_i notation in your solution respectively.
  • Z 5 + = { 1 , 2 , 3 , 4 , 5 } \Bbb{Z_{\leq 5}^+}=\{1,2,3,4,5\}

Prasun Biswas - 6 years, 1 month ago

Log in to reply

@Prasun Biswas @Pi Han Goh , Is this rigorous enough for you? :3

Prasun Biswas - 6 years, 1 month ago

@Prasun Biswas Good job.....i think u sound much more technical than me.... :P

Sakanksha Deo - 6 years, 1 month ago

Log in to reply

@Sakanksha Deo Lol, it's actually quite the opposite for me. I would describe myself as more of an abstract thinker than a technical thinker.

Prasun Biswas - 6 years, 1 month ago

Log in to reply

@Prasun Biswas Well, I don't think so....by d way..i guess u r in 11th....right!!

Sakanksha Deo - 6 years, 1 month ago

Log in to reply

@Sakanksha Deo Nope, I just gave my class 12th board finals a few months ago. Waiting for the board results to be announced on 20th of this month.

Prasun Biswas - 6 years, 1 month ago

Log in to reply

@Prasun Biswas Good luck..... :)

Sakanksha Deo - 6 years, 1 month ago

Log in to reply

@Sakanksha Deo Thanks, man! :)

Prasun Biswas - 6 years, 1 month ago

I did same.

Dev Sharma - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...