Olympiad problems

2008 IMAC Arhimede, 3

Let $ 0 \leq x \leq 2\pi$. Prove the inequality $ \sqrt {\frac {\sin^{2}x}{1 + \cos^{2}x}} + \sqrt {\frac {\cos^{2}x}{1 + \sin^{2}x}}\geq 1 $

2023 Bangladesh Mathematical Olympiad, P10

Tags: algebra , polynomial , inequalities

Let all possible $2023$-degree real polynomials: $P(x)=x^{2023}+a_1x^{2022}+a_2x^{2021}+\cdots+a_{2022}x+a_{2023}$, where $P(0)+P(1)=0$, and the polynomial has 2023 real roots $r_1, r_2,\cdots r_{2023}$ [not necessarily distinct] so that $0\leq r_1,r_2,\cdots r_{2023}\leq1$. What is the maximum value of $r_1 \cdot r_2 \cdots r_{2023}?$

2001 Singapore Senior Math Olympiad, 2

Tags: inequalities , min , algebra

Let $n$ be a positive integer, and let $f(n) =1^n + 2^{n-1} + 3^{n-2}+ 4^{n-3}+... + (n-1)^2 + n^1$ Find the smallest possible value of $\frac{f(n+2)}{f(n)}$ .Justify your answer.

2012 IMO Shortlist, A3

Tags: inequalities , n-variable inequality , ineqstd

Let $n\ge 3$ be an integer, and let $a_2,a_3,\ldots ,a_n$ be positive real numbers such that $a_{2}a_{3}\cdots a_{n}=1$. Prove that \[(1 + a_2)^2 (1 + a_3)^3 \dotsm (1 + a_n)^n > n^n.\] [i]Proposed by Angelo Di Pasquale, Australia[/i]

2010 China Team Selection Test, 1

Tags: inequalities , induction , function , combinatorics

Let $G=G(V,E)$ be a simple graph with vertex set $V$ and edge set $E$. Suppose $|V|=n$. A map $f:\,V\rightarrow\mathbb{Z}$ is called good, if $f$ satisfies the followings: (1) $\sum_{v\in V} f(v)=|E|$; (2) color arbitarily some vertices into red, one can always find a red vertex $v$ such that $f(v)$ is no more than the number of uncolored vertices adjacent to $v$. Let $m(G)$ be the number of good maps. Prove that if every vertex in $G$ is adjacent to at least one another vertex, then $n\leq m(G)\leq n!$.

2008 Singapore Junior Math Olympiad, 2

Tags: inequalities , algebra

Let $a.b,c,d$ be positive real numbers such that $cd = 1$. Prove that there is an integer $n$ such that $ab\le n^2\le (a + c)(b + d)$.

2011 JBMO Shortlist, 7

Tags: inequalities

$\boxed{\text{A7}}$ Let $a,b,c$ be positive reals such that $abc=1$.Prove the inequality $\sum\frac{2a^2+\frac{1}{a}}{b+\frac{1}{a}+1}\geq 3$

2014 Saudi Arabia IMO TST, 1

Tags: induction , inequalities

Let $a_1,\dots,a_n$ be a non increasing sequence of positive real numbers. Prove that \[\sqrt{a_1^2+a_2^2+\cdots+a_n^2}\le a_1+\frac{a_2}{\sqrt{2}+1}+\cdots+\frac{a_n}{\sqrt{n}+\sqrt{n-1}}.\] When does equality hold?

2008 IMC, 4

Tags: inequalities , linear algebra , matrix , group theory , abstract algebra , analytic geometry , geometry

We say a triple of real numbers $ (a_1,a_2,a_3)$ is [b]better[/b] than another triple $ (b_1,b_2,b_3)$ when exactly two out of the three following inequalities hold: $ a_1 > b_1$, $ a_2 > b_2$, $ a_3 > b_3$. We call a triple of real numbers [b]special[/b] when they are nonnegative and their sum is $ 1$. For which natural numbers $ n$ does there exist a collection $ S$ of special triples, with $ |S| \equal{} n$, such that any special triple is bettered by at least one element of $ S$?

2013 Tuymaada Olympiad, 4

Tags: inequalities , three variable inequality

Prove that if $x$, $y$, $z$ are positive real numbers and $xyz = 1$ then \[\frac{x^3}{x^2+y}+\frac{y^3}{y^2+z}+\frac{z^3}{z^2+x}\geq \dfrac {3} {2}.\] [i]A. Golovanov[/i]

2011 Today's Calculation Of Integral, 746

Tags: calculus , integration , floor function , inequalities , calculus computations

Prove the following inequality. \[n^ne^{-n+1}\leq n!\leq \frac 14(n+1)^{n+1}e^{-n+1}.\]

2012 Romania Team Selection Test, 2

Tags: function , inequalities

Let $f, g:\mathbb{Z}\rightarrow [0,\infty )$ be two functions such that $f(n)=g(n)=0$ with the exception of finitely many integers $n$. Define $h:\mathbb{Z}\rightarrow [0,\infty )$ by \[h(n)=\max \{f(n-k)g(k): k\in\mathbb{Z}\}.\] Let $p$ and $q$ be two positive reals such that $1/p+1/q=1$. Prove that \[ \sum_{n\in\mathbb{Z}}h(n)\geq \Bigg(\sum_{n\in\mathbb{Z}}f(n)^p\Bigg)^{1/p}\Bigg(\sum_{n\in\mathbb{Z}}g(n)^q\Bigg)^{1/q}.\]

2004 Purple Comet Problems, 13

Tags: geometry , 3d geometry , rectangle , inequalities

A cubic block with dimensions $n$ by $n$ by $n$ is made up of a collection of $1$ by $1$ by $1$ unit cubes. What is the smallest value of $n$ so that if the outer two layers of unit cubes are removed from the block, more than half the original unit cubes will still remain?

2019 ELMO Shortlist, A1

Tags: algebra , inequality , inequalities

Let $a$, $b$, $c$ be positive reals such that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=1$. Show that $$a^abc+b^bca+c^cab\ge 27bc+27ca+27ab.$$ [i]Proposed by Milan Haiman[/i]

2019 Tuymaada Olympiad, 1

Tags: algebra , sequence , inequalities

In a sequence $a_1, a_2, ..$ of real numbers the product $a_1a_2$ is negative, and to define $a_n$ for $n > 2$ one pair $(i, j)$ is chosen among all the pairs $(i, j), 1 \le i < j < n$, not chosen before, so that $a_i +a_j$ has minimum absolute value, and then $a_n$ is set equal to $a_i + a_j$ . Prove that $|a_i| < 1$ for some $i$.

2023 Junior Macedonian Mathematical Olympiad, 3

Tags: inequalities , algebra

Let $a$, $b$ and $c$ be positive real numbers such that $a+b+c=1$. Prove the inequality $$ \left ( \frac{1+a}{b}+2 \right ) \left ( \frac{1+b}{c}+2 \right ) \left ( \frac{1+c}{a}+2 \right )\geq 216.$$ When does equality hold? [i]Authored by Anastasija Trajanova[/i]

2019 Canada National Olympiad, 4

Tags: absolute value , inequalities , n-variable inequality

Prove that for $n>1$ and real numbers $a_0,a_1,\dots, a_n,k$ with $a_1=a_{n-1}=0$, \[|a_0|-|a_n|\leq \sum_{i=0}^{n-2}|a_i-ka_{i+1}-a_{i+2}|.\]

2003 AIME Problems, 11

Tags: probability , trigonometry , symmetry , inequalities , algebra , function , domain

An angle $x$ is chosen at random from the interval $0^\circ < x < 90^\circ$. Let $p$ be the probability that the numbers $\sin^2 x$, $\cos^2 x$, and $\sin x \cos x$ are not the lengths of the sides of a triangle. Given that $p = d/n$, where $d$ is the number of degrees in $\arctan m$ and $m$ and $n$ are positive integers with $m + n < 1000$, find $m + n$.

2007 Gheorghe Vranceanu, 2

Tags: inequalities , combinatorics , geometry

In the Euclidean plane, let be a point $ O $ and a finite set $ \mathcal{M} $ of points having at least two points. Prove that there exists a proper subset of $ \mathcal{M}, $ namely $ \mathcal{M}_0, $ such that the following inequality is true: $$ \sum_{P\in \mathcal{M}_0} OP\ge \frac{1}{4}\sum_{Q\in\mathcal{M}} OQ $$