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 \(GM-HM\) inequality for positive real numbers \(a_1\), \(a_2\), ..., \(a_n\): \[\sqrt[n]{a_1a_2...a_n} \geq \frac{n}{\frac{1}{a_1} + ... \frac{1}{a_n}}.\]
From IMO 1999. 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.
Proposed by USA for IMO 1993. For positive real numbers \(a,b,c,d\) prove that \[\frac{a}{b+2c+3d} + \frac{b}{c+2d+3a} + \frac{c}{d+2a+3b} + \frac{d}{a+2b+3c} \geq \frac{2}{3}.\]
Prove the \(AM-GM\) inequality for positive real numbers \(a_1\), \(a_2\), ..., \(a_n\): \[\frac{a_1+a_2+...+a_n}{n}\geq \sqrt[n]{a_1a_2...a_n}.\]
For non-negative real numbers \(a,b,c\) prove that \[a^3+b^3+c^3 \geq \frac{(a+b+c)(a^2+b^2+c^2)}{3}\geq a^2b+b^2c+c^2a.\]
Prove Nesbitt’s inequality, which states that for positive real numbers \(a,b,c\) we have \[\frac{a}{b+c}+\frac{b}{a+c}+\frac{c}{a+b}\geq \frac{3}{2}.\]
Due to Paul Erdős. Each of the positive integers \(a_1\), \(a_2\), ..., \(a_n\) is less than \(1951\). The least common multiple of any two of these integers is greater than \(1951\). Prove that \[\frac{1}{a_1} + ... + \frac{1}{a_n} < 1+ \frac{n}{1951}.\]