Understand the problem

Let $x_1,\ldots ,x_n$ be positive real numbers. Show that there exist $a_1,\ldots ,a_n\in\{-1,1\}$ such that:
\[a_1x_1^2+a_2x_2^2+\ldots +a_nx_n^2\ge (a_1x_1+a_2x_2+\ldots + a_n x_n)^2\]

Source of the problem
Iberoamerican olympiad 2011
Topic
Inequalities
Difficulty Level
Easy
Suggested Book
Inequalities: An Approach Through Problems
by B.J. Venkatachala

Start with hints

Do you really need a hint? Try it first!

Try using induction.
As the inequality is symmetric in x_1,x_2,\cdots x_n, introducing an order might help.
Consider the inequality as f(x_1,x_2,\cdots x_n)\ge 0.

Let us assume that x_1\ge x_2\ge\cdots\ge x_n.   Claim a_{odd}=1, a_{even}=-1 works.   Proof: For n=1 Trivial.   For n=2 The inequality is equivalent to x_1^2-x_2^2\ge (x_1-x_2)^2. Expanding, this becomes x_1x_2\ge x_2^2 which is a consequence of x_1\ge x_2.   For n\ge 3   Consider a_1x_1^2+a_2x_2^2+\cdots +a_nx_n^2-(a_1x_1+a_2x_2+\cdots +a_nx_n)^2 as a function of x_1 (say f(x_1)). We need to show that the minimum of f is at least 0. Clearly, f is linear in x_1 and the coefficient of x_1 is 2(x_2-x_3+x_4-x_5\cdots +(-1)^nx_n). Due to the order chosen, this coefficient is non-negative. Hence the minimum is attained at the minimum of x_1, which is x_2. However, putting x_1=x_2, we are left with  a_3x_3^2+a_4x_4^2+\cdots +a_nx_n^2\ge (a_3x_3+a_4x_4+\cdots a_nx_n)^2 which is true from the induction hypothesis.   QED

Watch the video (Coming Soon)

Connected Program at Cheenta

Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Similar Problems

Sum of Sides of Triangle | PRMO-2018 | Problem No-17

Try this beautiful Problem on Geometry from PRMO -2018.You may use sequential hints to solve the problem.

Recursion Problem | AMC 10A, 2019| Problem No 15

Try this beautiful Problem on Algebra from AMC 10A, 2019. Problem-15, You may use sequential hints to solve the problem.

Roots of Polynomial | AMC 10A, 2019| Problem No 24

Try this beautiful Problem on Algebra from AMC 10A, 2019. Problem-24, You may use sequential hints to solve the problem.

Set of Fractions | AMC 10A, 2015| Problem No 15

Try this beautiful Problem on Algebra from AMC 10A, 2015. Problem-15. You may use sequential hints to solve the problem.

Indian Olympiad Qualifier in Mathematics – IOQM

Due to COVID 19 Pandemic, the Maths Olympiad stages in India has changed. Here is the announcement published by HBCSE: Important Announcement [Updated:14-Sept-2020]The national Olympiad programme in mathematics culminating in the International Mathematical Olympiad...

Positive Integers and Quadrilateral | AMC 10A 2015 | Sum 24

Try this beautiful Problem on Rectangle and triangle from AMC 10A, 2015. Problem-24. You may use sequential hints to solve the problem.

Rectangular Piece of Paper | AMC 10A, 2014| Problem No 22

Try this beautiful Problem on Rectangle and triangle from AMC 10A, 2014. Problem-23. You may use sequential hints to solve the problem.

Probability in Marbles | AMC 10A, 2010| Problem No 23

Try this beautiful Problem on Probability from AMC 10A, 2010. Problem-23. You may use sequential hints to solve the problem.

Points on a circle | AMC 10A, 2010| Problem No 22

Try this beautiful Problem on Number theory based on Triangle and Circle from AMC 10A, 2010. Problem-22. You may use sequential hints to solve the problem.

Circle and Equilateral Triangle | AMC 10A, 2017| Problem No 22

Try this beautiful Problem on Triangle and Circle from AMC 10A, 2017. Problem-22. You may use sequential hints to solve the problem.