Library / /169 of 520
Algebra Difficulty 6.3 National olympiad Prove it
Example 3.2 (Huang Chendi) For all a,b,c∈[0,1], prove
(a+b+c)(bc+11+ca+11+ab+11)⩽5
Solution
(a+b+c)(bc+11+ca+11+ab+11)=bc+1a+ca+1b+ab+1c+bc+1b+c+ca+1c+a+ab+1a+b⩽bc+1a+ca+1b+ab+1c+1+1+1⩽bc+1a+ca+bb+ab+cc+3=bc+1a−ca+bca−ab+cab+5=a(bc+11−ca+bc−ab+cb)+5⩽a(1−c+bc−b+cb)+5=5
Equality holds if and only if a=0,b=c=1 and its cyclic permutations, thus the proposition is proved!
Want a route through all this instead of an archive?
The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.