Maths Olympiad Prep

Library / /62 of 520

Algebra Difficulty 5.9 AIME, harder Prove it

Example 4.2.7 Let a,b,c[0,2]a, b, c \in [0,2], and satisfy a+b+c=5a+b+c=5, prove: a2+b2+c29a^{2}+b^{2}+c^{2} \leq 9

Solution

Proof: Assuming abca \leq b \leq c, according to Lemma 5, we infer that a2+b2+c2a^{2}+b^{2}+c^{2} reaches its maximum value if and only if a=0a=0 or b=c=2b=c=2. In the first case, a=0a=0 is impossible, because 4b+c=54 \geq b+c=5, leading to a contradiction. In the second case, we have a=1a=1, thus max{a2+b2+c2}=12+22+22=9\max \left\{a^{2}+b^{2}+c^{2}\right\}=1^{2}+2^{2}+2^{2}=9

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.