A sequence of numbers x 1 , x 2 , … , x 1 0 0 has the property that for every integer k between 1 and 100 inclusive the number x k is k less than the sum of other 99 numbers. Given that x 5 0 = n m , where m and n are relatively prime positive integer, find m + 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.
Simple Explanation ! +1
It is easy to see that 2 x k + k = S , where S = n = 1 ∑ 1 0 0 x n .
So S = 2 x k + k = 2 x k + 1 + k + 1
x k + 1 = 2 1 ( 2 x k − 1 )
This gives x k = x 1 − 2 k − 1
Now,
2 x 1 + 1 = S = n = 1 ∑ 1 0 0 ( x 1 − 2 n − 1 ) = 1 0 0 x 1 − 2 4 7 5 x 1 = 9 8 2 4 7 6
x 5 0 = x 1 − 2 4 9 = 9 8 7 5
Good observation with comparing the terms.
I did the same
How is 2 x k + k = S ?
Log in to reply
x k = x 1 + x 2 + . . . + x k − 1 + x k + 1 + . . + x 1 0 0 − k add x k + k to both sides: 2 x k + k = x 1 + x 2 + . . . . + x 9 9 + x 1 0 0 2 x k + k = S in the case this helps, feel free to upvote my solution.
Problem Loading...
Note Loading...
Set Loading...
we found that 2 x n = S − n where is the sum of all the variables. so: 2 2 x 1 2 x 2 … … 2 x 9 9 2 x 1 0 0 = = = = S S S S − − − − 1 2 9 9 1 0 0 we add them to find 2 ( x 1 + x 2 + . . . + x 9 9 + x 1 0 0 ) = 1 0 1 S − ( 1 + 2 + . . + 9 9 + 1 0 0 ) 2 S = 1 0 0 S − 5 0 5 0 S = 9 8 5 0 5 0 = 4 9 2 5 2 5 we generalize for x n : x n = 2 S − n = 2 4 9 2 5 2 5 − n = 9 8 2 5 2 5 − 4 9 n put n=50 x 5 0 = 9 8 2 5 2 5 − 4 9 ∗ 5 0 = 9 8 7 5 and 7 5 + 9 8 = 1 7 3