Suppose a , b , c ∈ C satisfy a + b + c = k and a 1 + b 1 + c 1 = k 1 for some ∣ k ∣ < 1 .
Which of the following options is equivalent to j = 0 ∑ ∞ a 2 j + 1 + b 2 j + 1 + c 2 j + 1 ?
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.
Name of the problem was quite helpful!
Log in to reply
Yep :)
The intention wasn't to be a ridiculously hard problem, just make you see a new way to apply ideas/formulas.
Awesome problem!And awesome solution!
I also framed the same polynomial but in the end used newtons sum for the summation.
Log in to reply
Thanks!
How did you do the infinite newton's sums here? I'm not very familiar with them.
Log in to reply
Actually i didnt used newtons sum exactly, i found out a recurrence relation using the polynomial framed and then it struck to my mind that it is a method of deriving newtons formula only!
Log in to reply
@Harsh Shrivastava – Ah, nice! It's always a cool feeling when you're doing something and you realize halfway through "oh wait, this is _ !"
j = 0 ∑ ∞ a 2 j + 1 + b 2 j + 1 + c 2 j + 1
This is a GP of course. The sum of the above GP is = 1 − a 2 a + 1 − b 2 b + 1 − c 2 c
Now we also get a + b + c 1 = a 1 + b 1 + c 1
And we get a + b + c 1 − c 1 = a 1 + b 1 The above expression when simplified results as
( a + b + c ) c − ( a + b ) = a b a + b this results in
a b = − a c − b c − c 2 = a ( b + c ) = − c ( b + c ) This gives us a = − c and this results in
b = k and 1 − b 2 b = 1 − k 2 k .
Problem Loading...
Note Loading...
Set Loading...
For this problem, we will relate a , b , c to the roots of some easy to factor polynomial, making the sum a breeze!
First, let's consider the second equation given:
a 1 + b 1 + c 1 = k 1 ⇒ a b c = k ( a b + b c + a c )
Let a b + b c + a c = m . Then a b c = m k .
These equations look an awful lot like Vieta's Formula! Consider the following cubic:
x 3 − k x 2 + m x − m k = 0
Based on our conditions, this polynomial has roots a , b , c ! We can factor it as follows:
x 2 ( x − k ) + m ( x − k ) = 0 ⇒ ( x − m i ) ( x + m i ) ( x − k ) = 0
Where i = − 1 . Therefore a , b , c = m i , − m i , k
Since our sum is adding a , b , c raised to odd powers, the m i and − m i terms will cancel for every j in out summand. This makes the sum:
j = 0 ∑ ∞ k 2 j + 1 = k + k 3 + k 5 + k 7 + …
Which is an infinite geometric series with initial term k and ratio k 2 , meaning that if ∣ k ∣ < 1 , then the sum is 1 − k 2 k
Note that we could have m < 0 , in which case our polynomial would factor as ( x + m ) ( x − m ) ( x − k ) = 0 , but adding the roots to odd powers would still have the ± terms cancel