Prove the Cauchy-Schwartz inequality: for a natural number \(n\) and real numbers \(a_1, a_2, ... a_n\) and \(b_1, b_2, ...b_n\) we have \[(a_1b_1 + a_2b_2 + ...a_nb_n)^2 \leq (a_1^2+a_2^2+...+a_n^2)(b_1^2+b_2^2+...b_n^2).\]
Prove the \(HM-GM\) inequality for positive real numbers \(a_1,a_2,...a_n\): \[\frac{n}{\frac{1}{a_1} + ... \frac{1}{a_n}} \leq \sqrt[n]{a_1a_2...a_n}.\]
From 1999 IMO. Let \(n\geq 2\) be an integer. Determine the least possible constant \(C\) such that the inequality: \[\sum_{1\leq i<j\leq n} x_ix_j(x_i^2 + x_j^2) \leq C(\sum_{1\leq i\leq n}x_i)^4\] holds for all non-negative real numbers \(x_i\). For this constant \(C\) find out when the equality holds.
Today we will solve some problems using algebraic tricks, mostly
related to turning a sum into a product or using an identity involving
squares.
The ones particularly useful are: \((a+b)^2 =
a^2 +b^2 +2ab\), \((a-b)^2 = a^2 +b^2
-2ab\) and \((a-b) \times (a+b) = a^2
-b^2\). While we are at squares, it is also worth noting that any
square of a real number is never a negative number.
The evil warlock found a mathematics exercise book and replaced all the decimal numbers with the letters of the alphabet. The elves in his kingdom only know that different letters correspond to different digits \(\{0,1,2,3,4,5,6,7,8,9\}\) and the same letters correspond to the same digits. Help the elves to restore the exercise book to study.