⎩ ⎪ ⎪ ⎨ ⎪ ⎪ ⎧ x + x 1 x 7 + x 7 1 = n = n ( x 6 + x 6 1 )
If n 1 , n 2 , n 3 , … , n k are the solutions for n satisfying the above given conditions, evaluate ( i = 1 ∑ k n i 2 ) + k .
Clarification: x can be a complex number.
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.
For completeness, you should mention why there always exists complex solutions to x + x 1 = n .
Same way :)
Same way (+1) !
You could have simply used Vieta's for sum of squares.
Nonetheless, nice question.
Log in to reply
Yup. But I am a man who likes complicating things inspite of knowing the easier way. Thats my weakness :P
Thanks btw! XD
Then you'll have to proof that the polynomial does not have repeated roots.
@Nihar Mahajan Shouldn't it rather be zero??
x+1/x >= 2 for all x real.
If nothing is given, shouldn't we rather consider the functions to be real valued?? Or you could clear it up.
As x 7 + x 7 1 = ( x + x 1 ) ( x 6 + x 6 1 ) ⟹ x 5 + x 5 1 = 0 As x + x 1 = n by Binomial expansion ⟹ n 5 − 5 n 3 + 5 n = 0 ⟹ n = 0 ; n 4 − 5 n 2 + 5 = 0 . By Vieta's Theorem the two values of n 2 add-up to 5. There are 5 solutions in all including n=0, and +/- n whose squares add up to 5 each. So 5+5=10 is the summation and k=5. The answer is 15.
Please can you be more clear about your solution . although your solution is short,i did not get 100 % of it ..
Let P n = x n + x n 1 , where n ∈ N . Using Newton sums method, we have:
{ P 2 = P 1 2 − 2 = n 2 − 2 P n = P 1 P n − 1 − P n − 2 = n P n − 1 − P n − 2 for n ≥ 3
Therefore,
P 7 ⇒ P 5 n P 4 − P 3 n ( n P 3 − P 2 ) − P 3 ( n 2 − 1 ) P 3 − n P 2 ( n 2 − 1 ) ( n P 2 − P 1 ) − n P 2 n P 2 ( n 2 − 2 ) − n ( n 2 − 1 ) n ( n 2 − 2 ) 2 − n ( n 2 − 1 ) n ( n 4 − 5 n 2 + 5 ) ⇒ n = n P 6 − P 5 Since P 7 = n P 6 = 0 = 0 = 0 = 0 = 0 = 0 = 0 = 0 = ⎩ ⎪ ⎪ ⎨ ⎪ ⎪ ⎧ 0 ± 2 5 + 5 ± 2 5 − 5
There are 5 solutions for n and let n 5 = 0 , then the other 4 values of n come from n 4 + 0 n 3 − 5 n 2 + 0 n + 5 , therefore,
n 1 2 + n 2 2 + n 3 2 + n 4 2 = ( n 1 + n 2 + n 3 + n 4 ) 2 − 2 ( n 1 n 2 + n 1 n 3 + n 1 n 4 + n 2 n 3 + n 2 n 4 + n 3 n 4 ) = ( 0 ) 2 − 2 ( − 5 ) = 1 0
⇒ i = 1 ∑ k n i + k = 1 0 + 5 = 1 5
Problem Loading...
Note Loading...
Set Loading...
For simplicity, let T a = x a + x a 1 . We will compute T 6 , T 7 using the observation that T a T 1 = T a + 1 + T a − 1 . Let us tabulate values for T 1 to T 7 :
T 1 T 2 T 3 T 4 T 5 T 6 T 7 = n = n 2 − 2 = n 3 − 3 n = n 4 − 4 n 2 + 2 = n 5 − 5 n 3 + 5 n = n 6 − 6 n 4 + 9 n 2 − 2 = n 7 − 7 n 5 + 1 4 n 3 − 7 n
Since T 7 = n T 6 we have n 7 − 7 n 5 + 1 4 n 3 − 7 n = n 7 − 6 n 5 + 9 n 3 − 2 n ⇒ n 5 − 5 n 3 + 5 n = 0 ⇒ n ( n 4 − 5 n 2 + 5 ) = 0 .
Realized this later: From both given equations in the question we have T 7 = T 1 T 6 and using T a T 1 = T a + 1 T a − 1 we have T 7 = T 5 + T 7 ⇒ T 5 = 0 so we directly get n 5 − 5 n 3 + 5 n = 0 and there was no need to find T 6 , T 7 . Silly me.
We have one solution as n = 0 and we need to solve n 4 − 5 n 2 + 5 which can be accomplished using the substitution a = n 2 and the quadratic formula we have a = 2 5 ± 5 ⇒ n = ± 2 5 ± 5 . So there are 5 solutions for n giving k = 5 . Sum of squares of solutions simply equal 0 + 2 ( 2 5 + 5 ) + 2 ( 2 5 − 5 ) = 1 0
Thus sum of squares of solution + k = 1 0 + 5 = 1 5 .