f ( x ) = x 1 0 0 0 1 + x 9 9 9 1 + ⋯ + x 1 + 1 + x + x 2 + ⋯ + x 9 9 9 + x 1 0 0 0
Consider the above function for all real positive x . Find the minimum value of f ( x ) .
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.
Absolutely correct ! Anyways a observation that x n + x n 1 ≥ 2 for n ∈ R . so there are 1000 pairs of the above kind & 1. Minimum = 1 0 0 0 . 2 + 1 = 2 0 0 1
Since we have x i to all be positive for integers − 1 0 0 0 ≤ i ≤ 1 0 0 0 , we can apply the Cauchy-Schwarz inequality to get:
( x 1 0 0 0 1 + x 9 9 9 1 + … + x 1 + 1 + x + x 2 + … + x 9 9 9 + x 1 0 0 0 ) 2
= ( x 1 0 0 0 + x 9 9 9 + … + x + 1 + x 1 + x 2 1 + … + x 9 9 9 1 + x 1 0 0 0 1 ) ( x 1 0 0 0 1 + x 9 9 9 1 + … + x 1 + 1 + x + x 2 + … + x 9 9 9 + x 1 0 0 0 )
≥ ( x 1 0 0 0 ⋅ x 1 0 0 0 1 + x 9 9 9 ⋅ x 9 9 9 1 + … + x 9 9 9 1 ⋅ x 9 9 9 + x 1 0 0 0 1 ⋅ x 1 0 0 0 ) 2
= 2 0 0 1 2
With equality when x 1 0 0 0 1 = x 9 9 9 1 = … = x 1 = 1 = x = x 2 = … = x 9 9 9 = x 1 0 0 0 , or when x = 1
Problem Loading...
Note Loading...
Set Loading...
For fact, we know that a Arithmetic Mean ≥ Geometric Mean of the same terms. So:
2 0 0 1 x 1 0 0 0 1 + x 9 9 9 1 + . . . + x 1 + 1 + x + x 2 + . . . + x 9 9 9 + x 1 0 0 0 ≥ 2 0 0 1 x 1 0 0 0 1 × x 9 9 9 1 × . . . × 1 × x × x 2 × . . . × x 9 9 9 × x 1 0 0 0
Which give us:
x 1 0 0 0 1 + x 9 9 9 1 + . . . + x 1 + 1 + x + x 2 + . . . + x 9 9 9 + x 1 0 0 0 ≥ 2 0 0 1 2 0 0 1 1 ∴ x 1 0 0 0 1 + x 9 9 9 1 + . . . + x 1 + 1 + x + x 2 + . . . + x 9 9 9 + x 1 0 0 0 ≥ 2 0 0 1
Anything wrong, give me a feedback.