For positive real numbers a , b , c , d , find the remainder when the minimum possible integer value of the following expression is divided by 1 1 ( a 3 + b 3 + c 3 + d 3 ) ( a 3 2 . 2 5 + b 3 2 0 . 2 5 + c 3 4 2 . 2 5 + d 3 4 0 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.
Problem Loading...
Note Loading...
Set Loading...
By Cauchy Schwartz inequality, for 2 sets { a 1 , a 2 , . . . , a n } and { b 1 , b 2 , . . . , b n } , we have ∣ ∣ ∑ a i b i ∣ ∣ 2 ≤ ( ∑ a i 2 ) ( ∑ b i 2 )
For given equation, consider the sets
{ a 3 , b 3 , c 3 , d 3 } and { a 3 1 . 5 , b 3 4 . 5 , c 3 6 . 5 , d 3 2 0 }
Then by above inequality, given expression's least value is 1 . 5 + 4 . 5 + 6 . 5 + 2 0 = 3 2 . 5 Thus, it's minimum integer value will be 3 3 and remainder when 3 3 is divided by 1 1 is 0