Let x 1 , x 2 , x 3 , … , x 2 0 1 7 be positive integers such that x 1 + x 2 + ⋯ + x 2 0 1 7 = 3 0 1 8 .
Find the minimum value of x 1 2 + x 2 2 + ⋯ + x 2 0 1 7 2 .
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.
Nice Solution! But I did it the trivial way by first realizing that all x=1 or 2 would give the sum less or greater than, respectively, than the required one. BTW Congrats on coming 7th in Fall 2018, man.
Here's how I solved it intuitively, but it's not as nearly as elegant as @Sharky Kesa 's solution.
Convince yourself that, if a 1 + a 2 + ⋯ + a n = b 1 + b 2 + ⋯ + b n ,
a 1 2 + a 2 2 + ⋯ + a n 2 < b 1 2 + b 2 2 + ⋯ + b n 2
holds true if and only if a 1 , a 2 , ⋯ , a n have a smaller "spread" than b 1 , b 2 , ⋯ , b n . This can be more clearly seen if you consider the inequality a 2 + b 2 < ( a − d ) 2 + ( b + d ) 2 , which holds true for positive a , b , d such that b > a .
(Turns out that this can be expressed more formally: x qm 2 = x am 2 + σ x 2 where x qm is the quadratic mean, x am the arithmetic mean, and σ x the standard deviation. Thus, for smaller spread (decreasing σ x ) while keeping arithmetic mean constant, the quadratic mean will be smaller.)
With the problem, we want x 1 , x 2 , ⋯ , x 2 0 1 7 to be as close as possible together. Since their sum is 3 0 1 8 , some of them should be 1 's, and the remaining then should be 2 's. The only way to arrange this is if 1 0 1 6 of them are 1 's and the remaining 1 0 0 1 are 2 's.
Thus, the minimum value is 1 0 1 6 ⋅ 1 2 + 1 0 0 1 ⋅ 2 2 = 5 0 2 0 .
For positive reals, we see the equality holds when each variable is around 1.49....
If we constraint ourselves to positive integers, we see that each x must be in the vicinity of the above number.......that means x can be 1 or 2
Assuming there are "k" ones and "2017-k" twos, we can add up and find that k equals 1016........
Hence the minimum occurs and comes out to be 5020..........!!
@Sharky Kesa @Nick Turtle Is my solution okay??
Problem Loading...
Note Loading...
Set Loading...
Note the following is true for positive integers x i : ( x i − 1 ) ( x i − 2 ) ≥ 0 Simplifying yields x i 2 ≥ 3 x i − 2 . Summing this over i = 1 , 2 , . . . , 2 0 1 7 gives x 1 2 + x 2 2 + … + x 2 0 1 7 2 ≥ 3 ( x 1 + x 2 + … + x 2 0 1 7 ) − 4 0 3 4 = 9 0 5 4 − 4 0 3 4 = 5 0 2 0 Thus, the expression is greater than or equal to 5 0 2 0 wih equality occurring when x i ∈ { 1 , 2 } . Simplifying this yields 1 0 0 1 of the x i terms are 2 , and 1 0 1 6 are 1 , which is equality.