a , b , c are positive real numbers such that b + c 1 + c + a 1 + a + b 1 = 1 . If the minimum value of a 5 1 + b 5 1 + c 5 1 can be written as q p where p and q are positive integers with gcd(p,q) = 1 , find ( p + q )
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.
It is easy to prove that: ( a − t ) 5 1 + ( a + t ) 5 1 > a 5 2 : t > 0 , a > 0 So a 5 1 + b 5 1 + c 5 1 is maximum when: a = b = c = 2 3 M I N ( a 5 1 + b 5 1 + c 5 1 ) = 8 1 3 2 = q p ⇒ p + q = 1 1 3
Introduce x = a 1 , y = b 1 , z = c 1 .
Then a + b 1 + b + c 1 + c + a 1 becomes x + y x y + y + z y z + z + x z x . We know ( x + y ) 2 ≥ 4 x y ⟹ 4 ( x + y ) ≥ x + y x y . Continuing this way and adding we get 2 ⋅ 4 x + y + z ≥ x + y x y + y + z y z + z + x z x = 1 . Therefore we have ( x + y + z ) ≥ 2 with equality when x = y = z = 3 2 . Now, We use power mean inequality to arrive at, 3 x 5 + y 5 + z 5 ≥ 3 5 ( x + y + z ) 5 ⟹ x 5 + y 5 + z 5 ≥ 3 4 ( x + y + z ) 5 ≥ 3 5 2 5 = 8 1 3 2 . Both the inequalitites satisfy the inequality case when x = y = z = 2 / 3 and it indeed gives the value equal to 8 1 3 2 .
The minimum value of the second equation would only be reached if a = b = c . Thus, the first equation would become 2 a 3 = 1
Thus, a=b=c= 2 3
The second equation boils down to 3 4 2 5 = 8 1 3 2
Thus the answers is 32+81= 1 1 3
Problem Loading...
Note Loading...
Set Loading...
Nice problem! Well, I did it in a rather 'wrong ' way(I don't know if this is correct or not).
b + c 1 + c + a 1 + a + b 1 = 1
Multiplying a + b + c ,
b + c a + c + a b + b + a c + 3 = a + b + c
Equating the minimum of both the sides and then using Nesbitt's inequality,
2 3 + 3 = 3 3 a b c
a b c = 2 3 3
Now, using AM-GM in 2nd equation,
a 5 1 + a 5 1 + a 5 1 ≥ 3 3 a b c 5 1
Putting value of abc here, we get
≥ 3 4 2 5
≥ 8 1 3 2