If a 1 + b 1 + c 1 = a + b + c , then ( 2 a + b + c ) 2 1 + ( 2 b + a + c ) 2 1 + ( 2 c + a + b ) 2 1 ≤ y x ,
where x , y are coprime integers. Find the value of x + y .
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.
Thanks added.
For positive real numbers x , y , z , from the arithmetic-geometric-mean inequality,
2 x + y + z = ( x + y ) + ( x + z ) ≥ 2 ( x + y ) ( y + z ) , we obtain ( 2 x + y + z ) 2 1 ≤ 4 ( x + y ) ( x + z ) 1 .
Applying this to the left-hand side terms of the inequality to find, we get
( 2 a + b + c ) 2 1 + ( 2 b + a + c ) 2 1 + ( 2 c + a + b ) 2 1 ≤ 4 ( a + b ) ( a + c ) 1 + 4 ( b + c ) ( b + a ) 1 + 4 ( c + a ) ( c + b ) 1 =
4 ( a + b ) ( b + c ) ( a + c ) ( b + c ) + ( c + a ) + ( a + b ) = 2 ( a + b ) ( b + c ) ( a + c ) a + b + c . . . . . . . . . . . . . 1
A second application of the inequality of the arithmetic-geometric mean yields,
a 2 b + a b 2 + b 2 c + b c 2 + a 2 c + a c 2 ≥ 6 a b c or, equivalently,
9 ( a + b ) ( b + c ) ( c + a ) ≥ 8 ( a + b + c ) ( a b + b c + a c ) . . . . . . . . . . . . . . . . . 2
The supposition a 1 + b 1 + c 1 = a + b + c , can be written as
a b + b c + a c = a b c ( a + b + c ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Applying the arithmetic-geometric-mean inequality
x 2 y 2 + x 2 z 2 ≥ 2 x 2 y z thrice, we get
a 2 b 2 + b 2 c 2 + c 2 a 2 ≥ a 2 b c + a b 2 c + a b c 2 , which is equivalent to,
( a b + b c + c a ) 2 ≥ 3 a b c ( a + b + c ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
Combining (1), (2), (3), and (4) , we will finish the solution:
2 ( a + b ) ( b + c ) ( a + c ) a + b + c = 2 ( a + b ) ( b + c ) ( a + c ) ( a + b + c ) ( a b + b c + a c ) ∗ a b c ( a + b + c ) a b + b c + a c ∗ ( a b + b c + a c ) 2 a b c ( a + b + c )
≤ 2 ∗ 8 9 ∗ 1 ∗ 3 1 ≤ 1 6 3 .
Hence x = 3 , y = 1 6 ⇒ x + y = 3 + 1 6 = 1 9 .
Problem Loading...
Note Loading...
Set Loading...
This problem can be approached in numerous ways once RMS ≥ AM ≥ GM ≥ HM is understood. (RMS = root-mean square, AM = arithmetic mean, GM = geometric mean, HM = harmonic mean)
In other words: n x 1 2 + ⋯ + x n 2 ≥ n x 1 + ⋯ + x n ≥ n x 1 ⋯ x n ≥ x 1 1 + ⋯ + x n 1 n
From here, we can see that: a 1 + b 1 + c 1 3 ≤ 3 a + b + c
It becomes very clear now that both a + b + c and a 1 + b 1 + c 1 must be 3. In addition, this is only satisfied when a , b , c , are all equal, which confirms that they are each equal to 1. The rest of the problem is trivial.
To check, we apply the same relations to the following: 3 a 2 + b 2 + c 2 ≥ 3 a + b + c 3 a 2 + b 2 + c 2 ≥ 1 a 2 + b 2 + c 2 ≥ 3
This tells us that ( a + b + c ) 2 = a 2 + b 2 + c 2 + 2 ( a b + b c + a c ) = 9 a 2 + b 2 + c 2 = 9 − 2 ( a b + b c + a c ) ≥ 3 a b + b c + a c ≥ 3
Both of which hold true if all the variables are 1.
From here, we could expand out the formula and find more relations and simplify, but it is far easier to just plug in the value of 1 for each of the variables, confirming the answer is 1 6 3 , and no inequality relation is even necessary.
Note: I personally think the problem should be worded a bit more technically, specifying that y x should be the minimum value possible.