Let x 1 , x 2 , … , x 2 0 be real numbers satisfying
m = 1 ∑ 2 0 m x m − m 2 = 2 1 m = 1 ∑ 2 0 x m .
It is given that there is only one unique solution to the 20-tuple, ( x 1 , x 2 , … , x 2 0 ) . Find the value of x 1 + x 2 + ⋯ + x 2 0 .
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.
Given,
∑ m = 1 2 0 m x m − m 2 = 2 1 ∑ m = 1 2 0 x m ⇒ ∑ m = 1 2 0 x m − ∑ m = 1 2 0 2 m x m − m 2 = 0 ⇒ ∑ m = 1 2 0 ( x m − 2 m x m − m 2 ) = 0 ⇒ ∑ m = 1 2 0 { ( x m − m 2 ) − 2 m x m − m 2 + m 2 } = 0 ⇒ ∑ m = 1 2 0 ( x m − m 2 − m ) 2 = 0
Therefore every term is equal zero. That means,
x m − m 2 − m = 0 , for m = 1 , 2 , 3 , . . . . . . . , 2 0
⇒ x m = 2 m 2
⇒ ∑ m = 1 2 0 x m = ∑ m = 1 2 0 2 m 2 = 2 × 6 2 0 ( 2 0 + 1 ) ( 2 × 2 0 + 1 ) = 5 7 4 0
Define y i = x i − i 2 .
Then the equation can be re-expressed as i = 1 ∑ 2 0 i y i = i = 1 ∑ 2 0 2 y i + i 2
It is obvious, then, that each term of the sum corresponds to a term in the other sum in the AM-GM inequality: 2 y i + i 2 ≥ y i ⋅ i 2 = i y i
Therefore equality only occurs when y i = i 2 , and hence the sought for sum is equivalent to: i = 1 ∑ 2 0 y i + i 2 = 2 i = 1 ∑ 2 0 i 2 = 2 6 ( 2 0 ) ( 2 0 + 1 ) ( 2 ⋅ 2 0 + 1 ) = 5 7 4 0
Same way. Nice solution
Problem Loading...
Note Loading...
Set Loading...
Note that x − 1 ≤ 2 x , with equality for x = 2 . Now k = 1 ∑ 2 0 k x k − k 2 = k = 1 ∑ 2 0 k 2 k 2 x k − 1 ≤ k = 1 ∑ 2 0 k 2 2 k 2 x k = k = 1 ∑ 2 0 2 x k with equality for x k = 2 k 2 and ∑ k = 1 2 0 x k = 2 ∑ k = 1 2 0 k 2 = 2 ∗ 2 8 7 0 = 5 7 4 0