PQR Method For Solving Inequalities - II (Turgor)
PQR Method For Solving Inequalities - II (Turgor)
Almost all inequalities considered in our project are symmetric. Hence if plugging
(a0 , b0 , c0 ) into our inequality we obtain an equality, then plugging a permutation of
(a0 , b0 , c0 ) into the same inequality we also obtain an equality. For brevity, we shall
mention only triples that are not permutations of one another.
Therefore after reducing our inequality we assume without loss of generality that either
a = b or a = 0.
1. Let a, b, c be non-negative real numbers such that a + b + c = 1. Prove that
1 + 12abc > 4(ab + bc + ca).
Solution. The desired inequality can be written as 1 + 12r > 4q , and the relation
a + b + c = 1 can be written as p = 1. Fix p and r. Then q attains the maximal value
when a = b and c = 1 − 2a. Substituting a = b and c = 1 − 2a, we get
3
1 1
24a3 − 24a2 + 8a − 1 6 0 ⇔ 24 a − − 6 0.
3 9
The left hand side attains its maximal value when a does, i.e. a = 12 . Equality is attained
when a = b = 12 , c = 0.
2. Let a, b, c be real numbers such that
a + b + c = 9, ab + bc + ca = 24.
Prove that 16 6 abc 6 20. Prove moreover that for any r ∈ [16, 20] there exist real
numbers a, b, c such that a + b + c = 9, ab + bc + ca = 24, abc = r.
Solution. From the problem 22 it follows that numbers a, b, c are real if and only if p,
q , r are real and T (p, q, r) > 0. Substituting p = 9 and q = 24, we get
1
in r, it follows that P (a, b, c) attains its maximal and minimal values only when either
a = b or a = 0.
4. (Russia TST, 2015) Let a, b, c be non-negative real numbers such that 1 + a + b + c =
2abc. Prove that
ab bc ca 3
+ + > .
1+a+b 1+b+c 1+c+a 2
Solution. The desired inequality can be written as
2q 2 − q(p + 1) + 9r + 2pr − 3(p + 1)2 > 0,
and the relation 1 + a + b + c = 2abc can be written as 1 + p = 2r. Fix p and r. The left
hand side is a quadratic polynomial in q , its leading coecient is positive. Its minimal
value is attained when q0 = p+14 .
Let us prove an inequality 4q − (p + 1) > 0. Fix p and r. Left hand side attains its
minimal value when q does. Substituting a = b, c = 2a 2 −1 in 4q − (p + 1) > 0, we get
1+2a
which is correct.
Since 4q −(p+1) > 0, it follows that left hand side is an increasing function. Substituting
a = b and c = 2a 2 −1 in the desired inequality, we get
1+2a
Fix p and q . Since r 6 pq , it follows that left hand side attains its minimal value when
r attains either maximal or minimal value.
• If a = 0, then the desired inequality can be written as
(b − c)2 (b2 + bc + c2 )
> 0.
2bc(b + c)2
2
• If a = b, then the desired inequality can be written as
7. Express polynomials a2 + b2 + c2 , a2 b + a2 c + b2 a + b2 c + c2 a + c2 b, a3 + b3 + c3 ,
(ab)2 + (bc)2 + (ca)2 , a4 + b4 + c4 , (a + b)(b + c)(c + a) in terms of p, q, r.
Solution.
a2 + b2 + c2 = (a + b + c)2 − 2(ab + bc + ca) = p2 − 2q,
a2 b + a2 c + b2 a + b2 c + c2 a + c2 b = (a + b + c)(ab + ac + bc) − 3abc = pq − 3r,
a3 + b3 + c3 = p3 − 3(a2 b + a2 c + b2 a + b2 c + c2 a + c2 b) − 6abc = p3 − 3pq + 3r,
(ab)2 + (bc)2 + (ca)2 = (ab + bc + ca)2 − 2(ab2 c + abc2 + a2 bc) = q 2 − 2pr,
a4 + b4 + c4 = (a2 + b2 + c2 )2 − 2(a2 b2 + b2 c2 + c2 a2 ) = p4 − 4p2 q + 2q 2 + 4pr,
(a + b)(b + c)(c + a) = (p − c)(p − a)(p − b) = p3 − p · p2 + pq − r = pq − r.
+ abc(ak−3 + bk−3 + ck−3 ) = (sk + abk−1 + ack−1 + bak−1 + bck−1 + cak−1 + cbk−1 ) −
− (abk−1 + ack−1 + bak−1 + bck−1 + cak−1 + cbk−1 + abck−2 + abk−2 c + ak−2 bc) +
+ (abck−2 + abk−2 c + ak−2 bc) = sk .
3
holds, it follows that G2 can be expressed as a polynomial in p, q , r. Finally, for a sum
ak bl cm + . . . in G3 we factorize (abc)n (where n = min(k, l, m)) and reduce our problem
to the previous cases.
a + b + c = t,
10. Let t be a real number. Solve a system of equations: a2 + b2 + c2 = t2 ,
3
a + b3 + c3 = t3 .
a+b +c = t p=t p = t
Solution. a2 + b2 + c2 = t2 ⇔ p2 − 2q = t2 ⇔ q=0
3
a + b3 + c3 = t3
3
p − 3pq + 3r = t3 r=0
If q = 0, then two of a, b, c are equal to zero. So, there are 3 solutions: a = b = 0, c = t
and its permutations.
11. Let a, b, c be real numbers. Prove that q 2 > 3pr .
Solution. Substituting a, b, c in the desired inequality, we get
1 1 1
(ab + bc + ca)2 > 3(a + b + c)abc. ⇔ (ab − ac)2 + (ab − bc)2 + (ac − bc)2 > 0.
2 2 2
r
p q √
12. Let a, b, c be non-negative real numbers. Prove that > > 3 r.
3 3
Solution. r
p p
> ⇔ p2 > 3q ⇔ a2 + b2 + c2 > ab + bc + ca.
3 3
√ √
r
q ab + bc + ca 3
> 3r ⇔ > a2 b2 c2 .
3 3
Using the AM-GM inequality for ab, bc, ca, we get the desired inequality.
13. Prove that a and b are roots of equation x2 − px + q = 0 and there are no other
roots.
Solution. (x − a)(x − b) = x2 − (a + b)x + ab = x2 − px + q. Left hand side equals 0 if
and only if either x = a or x = b.
14. Prove that if p and q are real, then either a and b are both real or b is the complex
conjugate of a.
Solution. If a is real, then b = p − a is also real as a dierence of real numbers. Assume
that a = x + yi, where y 6= 0. Then b = p − a = (p − x) − yi. Since
q = ab = (x + iy)(p − x − yi) = (xp − x2 + y 2 ) + (py − 2xy)i,
4
Solution. p and q should be real numbers and p2 − 4q should be non-negative.
17. Prove that a and b are real and non-negative if and only if p and q are non-negative
real numbers which satisfy conditions from the previous problem.
Solution. It is an obvious corollary of the previous problem.
18. Prove that a, b, c are roots of equation x3 − px2 + qx − r = 0 and there are no other
roots.
Solution. The proof is similar to the proof of the problem 13.
19. Prove that for real numbers p0 , q 0 , r0 there exist complex numbers a0 , b0 , c0 (unique
up to a permutation) such that p0 = a0 + b0 + c0 , q 0 = a0 b0 + b0 c0 + c0 a0 , r0 = a0 b0 c0 . Prove
moreover that either numbers a0 , b0 , c0 are real or a0 is real and b0 is a complex conjugate
of c0 (up to a permutation).
Solution. Since any polynomial of odd degree has a real root, it follows that the desired
statement is an obvious corollary of the problem 14.
20. Assume that p, q , and r are real numbers. Prove that if a, b, c are real, then
(a − b)(b − c)(c − a) is real, otherwise it is pure imaginary.
Solution. If a, b, c are real numbers, then the problem is obvious. Let a be a real
number, b = x + yi, c = x − yi. Then
(a − b)(b − c)(c − a) = −(a2 − (b + c)a + bc)(b − c) = −2yi(a2 + 2ax + x2 + y 2 ).
Solution.
(a−b)2 (b−c)2 (c−a)2 = (ab2 +bc2 +ca2 −a2 b−b2 c−c2 a)2 = (ab2 +bc2 +ca2 +a2 b+b2 c+c2 a)2 −
22. Criterion for reality. Let (p, q, r) be a triple of real numbers. Prove that the
numbers a, b, c (which are dened as the roots of x3 − px2 + qx − r = 0 counting
multiplicities) are real if and only if T (p, q, r) > 0, where T (p, q, r) is a polynomial in 3
variables dened as T (p, q, r) = −4p3 r + p2 q 2 + 18pqr − 4q 3 − 27r2 .
Solution. It is an obvious corollary of the problems 20 and 21.
23. Non-negativity lemma. Prove that p, q , r > 0 and T (p, q, r) > 0 if and only if
a, b, c are non-negative real numbers.
5
Solution. It is an obvious corollary of the previous problem.
24. r -lemma. Fix some values p = p0 and q = q0 such that there exists at least one
value of r for which the triple (p0 , q0 , r) is acceptable. Prove that such triple with the
minimal value of r corresponds to a triple (a, b, c) in which either two numbers are equal,
or abc = 0. Prove moreover that such triple with the maximal value of r corresponds to
a triple (a, b, c) containing two equal numbers.
Solution. For triple (p, q, r) to be acceptable it is necessary to have T (p0 , q0 , r) > 0
and r > 0 (p0 , q0 are non-negative, by the condition). Since T (p0 , q0 , r) is a quadratic
function in r with non-negative leading coecient, it follows that T (p0 , q0 , r) > 0 denes
a segment. Therefore the maximal value of r is right end-point of that segment and the
minimal one is either left end-point or 0. Since T (p0 , q0 , r) = 0 in the end-points, it
follows that two numbers of a, b, c are equal (T (p, q, r) = (a − b)2 (b − c)2 (c − a)2 ). If
r = 0, then one number of a, b, c equals 0.
25. q -lemma. Fix some values p = p0 and r = r0 such that there exists at least
one value of q for which the triple (p0 , q, r0 ) is acceptable. Prove that such triples with
minimal and maximal values of q correspond to a triple (a, b, c) containing two equal
numbers.
Solution. T (p0 , q, r0 ) is a third degree polynomial in q with negative leading coecient.
Constant term equals −4p30 r0 − 27r02 , so it is negative. Therefore T (p0 , q, r0 ) > 0 denes
a union of a segment with non-negative end-points and a ray (−∞, q 0 ], where q 0 6 0.
Now the proof is trivial.
26. p-lemma. Fix some values q = q0 and r = r0 > 0 such that there exists at least
one value of p for which the triple (p, q0 , r0 ) is acceptable. Prove that such triples with
minimal and maximal values of p correspond to a triple (a, b, c) containing two equal
numbers.
Does the same statement holds true when r0 = 0?
Solution. The proof is similar to the proof of the problem 25 when r0 6= 0. If r0 = 0,
√
then p ∈ [2 q0 , +∞), i.e. p is unbounded.
27. Let a, b, c be non-negative real numbers such that a1 + 1b + 1c = 1. Prove that
(a − 1)(b − 1)(c − 1) > 8.
Solution. The desired inequality can be written as
r−q+p−9>0
and the relation + + = 1 can be written as q = r. From relation it follows that
1
a
1
b
1
c
r 6= 0. Fix q and r. Then p attains the minimal value when a = b. Substituting a = b
and c = a−2a
, we get
2a2 − 12a + 18 = 2(a − 3)2 6 0.
Equality is attained when a = b = c = 3.
28. Let a, b, c be non-negative real numbers such that a + b + c = 3. Prove that
1 1 1 3
+ + 6 .
9 − ab 9 − bc 9 − ca 8
6
Solution. The desired inequality can be written as
−3r2 + 19rp − 99q + 243 > 0
and the relation a + b + c = 3 can be written as p = 3. Fix p and r. Then q attains the
maximal value when a = b. Substituting a = b and c = 3 − 2a, we get
6a4 − 9a3 − 27a2 + 57a − 27 = 3(a − 1)2 (2a2 + a − 9) 6 0.
and the relation a + b + c = 3 can be written as p = 3. Fix p and r. Then q attains the
maximal value when a = b. Substituting a = b and c = 3 − 2a, we get
4a4 − 12a3 + 13a2 − 6a + 1 = (2a − 1)2 (a − 1)2 > 0.
7
• If a = b and t = ac , then the desired inequality can be written as
If a = b = c = 0, then inequality turns out to be equality. Fix p and q . Since 7p2 > 3q ,
it follows that left hand side is linear in r and the minimal value is attained when r is
minimal.
• If a = 0, then the desired inequality can be written as
c(c2 − a2 )2 > 0.
If a = b = c = 0, then inequality turns out to be equality. Fix p and q . Left hand side is
linear in r and the minimal value is attained when r is minimal.
• If a = 0 and t = cb , then the desired inequality can be written as
8
• If a = b and t = ac , then the desired inequality can be written as
4X + 69 > 27Y.
Solution. The desired inequality can be written as
f (p, q, r) = −225r3 − 50p3 r2 + 4q 3 r + 55pqr2 + 6p2 q 2 r − 4p4 qr − 4pq 4 + 2p3 q 3 > 0. (∗)
Fix p = p0 and q = q0 . Then f 00 (p0 , q0 , r) = −1350r − 100p30 + 110p0 q0 . Let us prove that
−1350r − 100p3 + 110pq 6 0.
Fix p and r. The left hand side is linear in q . So q attains the minimal value when
a = b. Since inequality is homogeneous, we see that it is enough to prove inequality
when a = b = 1. Substituting a = b = 1 in the desired inequality, we get
−20(5c3 + 19c2 + 100c + 29) 6 0,
which is correct.
From f 00 (p0 , q0 , r) 6 0 it follows that f is concave. So it attains the minimal value when
r is either minimal or maximal.
• Substituting a = 0 in (∗), we get
9
35. a) Let P (a, b, c) be a homogeneous symmetric polynomial of degree not greater than
8. Find an algorithm checking whether P is non-negative when a, b, c are non-negative.
We assume that we are ale to nd extrema and zeroes of an arbitrary function in one
variable.
Solution. Without loss of generality, the degree of the polynomial P (a, b, c) is equal to
8. If a = 0 and t = cb , then
P (0, b, c) > 0 ⇔ P (0, 0, c) > 0, P (0, 1, t) > 0.
If a = b and t = ac , then
P (a, a, c) > 0 ⇔ P (0, 0, c) > 0, P (1, 1, t) > 0.
Consider an inequality
P (a, b, c) = A(q)r2 + B(q)r + C(q) > 0
Fix q such that A(q) 6 0. Then P (a, b, c) > 0 ⇔ P (a, a, c) > 0, P (0, b, c) > 0. Fix q such
that A(q) > 0. The left hand side is minimal when r = r0 = − 2A(q)
B(q)
. Since T (p, q, r) > 0,
9q−2 2−6q √ √
it follows that r belongs to a segment I = 27 − 27 1 − 3q, 27 + 2−6q 9q−2
1 − 3q .
27
If r0 ∈/ I , then
P (a, b, c) > 0 ⇔ P (a, a, c) > 0, P (0, b, c) > 0.
If r0 ∈ I , then
P (a, b, c) > 0 ⇔ A(q)r02 + B(q)r0 + C(q) > 0 ⇔ 4A(q)C(q) − B 2 (q) > 0. (∗)
10
c*)Find an analogous algorithm for any homogeneous symmetric polynomial.
√ √ √
36. Let a, b, c be non-negative real numbers such that a + b + c = 3. Prove that
39. Let a, b, c be positive real numbers such that a2 + b2 + c2 + abc = 4. Prove that
a2 b2 c2
+ + 6 1.
4 − bc 4 − ca 4 − ab
Solution. The desired inequality can be written as
abc(a +b +c3 )−4(a2 +b2 +c2 )(ab+bc+ca)+a2 b2 c2 +16(a2 +b2 +c2 )+16(ab+bc+ca)−64 6 0.
3 3
11
• If x = 0, then a = 2. Now if we recall a2 + b2 + c2 + abc = 4, we get b = c = 0.
This solution has been found before.
• If x = y , then
z = 4x − x2 = 4(a + 2) − (a + 2)2 = 4 − a2 .
Therefore a = b, c = 2 − a2 . If we combine this with (*), we obtain
0 6 (a − 1)2 (a + 2)2 (a2 − 2a + 2).
c a b
= 2 2π = .
sin2 4π
7 sin 7 sin2 π
7
Hint. Perform the substitution a = x + 2 cos π7 y , b = y + 2 cos π7 z , c = z + 2 cos π7 x.
Then we get homogeneous inequality.
But there exists another solutions. By denition put
f (a, b, c) = (a2 + b2 + c2 )2 − 3(a3 b + b3 c + c3 a).
Then either
1 2 1
f (a, b, c) = (a − 2ab + bc − c2 + ac)2 + (b2 − 2bc + ac − a2 + ab)2 +
2 2
1
+ (c2 − 2ac + ab − b2 + bc)2 ,
2
or
1 2 3
f (a, b, c) = (a + b2 − 3ab + 3ac − 2c2 )2 + (a2 − ab − ac − b2 + 2bc)2 .
4 4
41. Find conditions on numbers p, q , r necessary and sucient for
a) numbers a, b, c to be not less than 1;
Solution. It is an obvious corollary of the problem 23. T (p, q, r) > 0 and
(a − 1) + (b − 1) + (c − 1) > 0 ⇔ p > 3,
12
(a − 1)(b − 1)(c − 1) > 0 ⇔ r − q + p − 1 > 0.
b) numbers a, b, c to be side lengths of a triangle (perhaps degenerate);
Hint. Use the problem 23 for numbers (a + b − c), (a − b + c), (−a + b + c).
c) non-negative real numbers a, b, c to satisfy 2 min(a, b, c) > max(a, b, c).
Hint. 2 min(a, b, c) > max(a, b, c) ⇔ 2a > b, 2a > c, 2b > a, 2b > c, 2c > a, 2c > b ⇔
⇔ a > 0, b > 0, c > 0, (2a − b)(2b − a) > 0, (2b − c)(2c − b) > 0, (2a − c)(2c − a) > 0.
42. Let a, b, c be real numbers such that a, b, c ∈ 31 , 3 . Prove that
a b c 7
+ + > .
a+b b+c c+a 5
Hint. Perform the substitution x = ab , y = cb , z = ac .
43. Let a, b, c be side lengths of a triangle. Prove that
1 1 1 a b c
(a + b + c) + + >6 + + .
a b c b+c a+c b+a
44. Prove that there exists a polynomial S(x, y, z) such that the following conditions
are equivalent: (i) a, b, c are real numbers; (ii) S(x, y, z) > 0, where x = a + b + c,
y = a2 + b2 + c2 , z = a3 + b3 + c3 .
Solution.
x2 − y x3 − 3xy + 2z
S(x, y, z) = T (p, q, r) = T x, , .
2 2
45. Prove that the following conditions are equivalent: (i) s ∈ 86 9 , 10 ; (ii) there exist
13
Assume that 6 n 6 2. Prove that a + b + c 6 2(n + 3).
3
p
b) 2
Hint. x = a + b + c, y = a + b + c + nabc, z = abc.
2 2 2
14