If a + b = 1 , the minimum value of
( a + a 1 ) 2 + ( b + b 1 ) 2
can be expressed in the form n m , where m , n are coprime, positive integers. Find the value of m + n .
(This problem is not original.)
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.
Set f ( x ) = ( x + x 1 ) 2 , we have f ′ ′ ( x ) = 2 ( 1 + x 4 3 ) ≥ 0
So f ( x ) is convex and 2 f ( a ) + f ( b ) ≥ f ( 2 a + b ) = 4 2 5
Problem Loading...
Note Loading...
Set Loading...
First of all, note that 2 a 2 + b 2 ≥ 2 a + b ( a b ) 2 ≥ ( 2 a + b ) 4
both actually work ∀ a , b ∈ R . You can see this for yourself, I won't present a proof, although I have rigorous proofs for these.
2 a 2 + b 2 ≥ 2 a + b = 2 1 ⟹ a 2 + b 2 ≥ 0 . 5 ( 1 ) 2 ( a 1 ) 2 + ( b 1 ) 2 ≥ 2 a 1 + b 1
⟹ ( a 1 ) 2 + ( b 1 ) 2 ≥ 2 ( a b ) 2 1 ≥ 2 ( 2 a + b ) 4 1 = 8 ( 2 ) ( a + a 1 ) 2 + ( b + b 1 ) 2
= a 2 + b 2 + ( a 1 ) 2 + ( b 1 ) 2 + 4 ≥ (1)(2) 1 2 . 5