Let a 1 , a 2 , a 3 , … , a n be positive real numbers. If b 1 , b 2 , b 3 … b n is a permutation of a 1 , a 2 , a 3 … a n then find the minimum value of the expression below:
r = 1 ∑ 1 2 3 4 5 6 7 8 9 0 b r a r
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.
I just thought that the solution would be that each term were equal to one.
Problem Loading...
Note Loading...
Set Loading...
Use AM - GM inequality for the ′ n ′ fractions ,
n b 1 a 1 + b 2 a 2 + ⋯ + b n a n ≥ n b 1 a 1 × b 2 a 2 × ⋯ × b n a n
Since b 1 , b 2 , b 3 … b n is a permutation of a 1 , a 2 , a 3 … a n , R . H . S becomes 1 .
n b 1 a 1 + b 2 a 2 + ⋯ + b n a n ≥ n 1
b 1 a 1 + b 2 a 2 + ⋯ + b n a n ≥ n
Since here n = 1 2 3 4 5 6 7 8 9 0 ,
r = 1 ∑ 1 2 3 4 5 6 7 8 9 0 b r a r ≥ 1 2 3 4 5 6 7 8 9 0