Difference between revisions of "2011 JBMO Problems/Problem 1"
Rockmanex3 (talk | contribs) (Solution to Problem 1 -- neat inequality problem) |
(→Solution) |
||
(2 intermediate revisions by one other user not shown) | |||
Line 27: | Line 27: | ||
\prod(a^5+a^4+a^3+a^2+a+1) &\ge 8(a^2+a+1)(b^2+b+1)(c^2+c+1). | \prod(a^5+a^4+a^3+a^2+a+1) &\ge 8(a^2+a+1)(b^2+b+1)(c^2+c+1). | ||
\end{align*}</cmath> | \end{align*}</cmath> | ||
+ | |||
+ | ==Solution 2 (credit to dskull16)== | ||
+ | |||
+ | Note that the inequality clearly holds when <math>a=b=c=1</math> and the method below can be used to verify the inequality is true in the case where one of <math>a,b,c</math> is one (to avoid complications with dividing by zero). | ||
+ | |||
+ | Write <math>a^5+a^4+a^3+a^2+a+1 = \frac{a^6-1}{a-1}</math> | ||
+ | |||
+ | Write <math>a^2 + a + 1 = \frac{a^3-1}{a-1}</math> by the sum of a geometric series formula. Thus we get: | ||
+ | |||
+ | <math>\frac{a^6-1}{a-1}\cdot\frac{b^6-1}{b-1}\cdot\frac{c^6-1}{c-1} \geq 8\cdot\frac{a^3-1}{a-1}\cdot\frac{b^3-1}{b-1}\cdot\frac{c^3-1}{c-1}</math> | ||
+ | |||
+ | Multiply both sides by <math>(a-1)(b-1)(c-1)</math> and recognise the difference of two squares to get: | ||
+ | |||
+ | <math>(a^3+1)(b^3+1)(c^3+1) \geq 8</math> | ||
+ | <math>\implies (abc)^3 + a^3 + b^3 + c^3 + (ab)^3 + (bc)^3 + (ac)^3 + 1 \geq 8</math> | ||
+ | <math>\implies a^3 + b^3 + c^3 + (ab)^3 + (bc)^3 + (ac)^3 \geq 6</math> | ||
+ | |||
+ | Now use AM-GM on each of <math>a^3 + b^3 + c^3</math> and <math>(ab)^3 + (bc)^3 + (ac)^3</math> to obtain: | ||
+ | |||
+ | <math>a^3 + b^3 + c^3 \geq 3</math> | ||
+ | |||
+ | <math>(ab)^3 + (bc)^3 + (ac)^3 \geq 3</math> | ||
+ | |||
+ | which combines to give the final result. | ||
==See Also== | ==See Also== | ||
− | {{JBMO box|year=2011|before=First Problem|num-a=2}} | + | {{JBMO box|year=2011|before=First Problem|num-a=2|five=}} |
+ | |||
+ | [[Category:Intermediate Algebra Problems]] |
Latest revision as of 17:00, 3 March 2024
Problem
Let be positive real numbers such that . Prove that:
Solution
Since , . By AM-GM Inequality, Adding the inequalities together and factoring yields Since are positive, , , and are all greater than 0. That means
Solution 2 (credit to dskull16)
Note that the inequality clearly holds when and the method below can be used to verify the inequality is true in the case where one of is one (to avoid complications with dividing by zero).
Write
Write by the sum of a geometric series formula. Thus we get:
Multiply both sides by and recognise the difference of two squares to get:
Now use AM-GM on each of and to obtain:
which combines to give the final result.
See Also
2011 JBMO (Problems • Resources) | ||
Preceded by First Problem |
Followed by Problem 2 | |
1 • 2 • 3 • 4 | ||
All JBMO Problems and Solutions |