Let x 1 , x 2 , … , x n be positive real numbers such that x 1 + x 2 + ⋯ + x n = 1 . What is the minimum value of f ( x 1 , x 2 , … , x n ) if f ( x 1 , x 2 , … , x n ) = c y c ∑ x n x 1 + x 2 + ⋯ + x n − 1 ? Submit your answer for n = 1 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.
For positive real numbers x 1 , x 2 , … , x 1 0 , the given sum may be written as ( x 1 1 + x 2 1 + ⋯ + x 1 0 1 ) ( x 1 + x 2 + ⋯ + x 1 0 ) − x 1 x 1 − x 2 x 2 − ⋯ − x 1 0 x 1 0 .
Hence, by the Cauchy-Schwarz inequality, we see that f ( x 1 , x 2 , … , x 1 0 ) ≥ ( i = 1 ∑ 1 0 x i x i ) 2 − 1 0 = 1 0 2 − 1 0 = 9 0 .
Problem Loading...
Note Loading...
Set Loading...
Since the numerator is 1 − x n , we have f ( x 1 , x 2 , … , x n ) = − n + ∑ x i 1
To minimise f , we need to minimise ∑ x i 1 subject to ∑ x i = 1 .
But this is just the AM-HM inequality: n ∑ x i n 1 ∑ x i 1 ≥ ∑ x i 1 n ≥ ∑ x i 1 n ≥ n 2
Hence the minimum value of f is n 2 − n , or 9 0 in this case. (This minimum is achieved when x i = n 1 for each i .)