This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 6530

2004 USA Team Selection Test, 1

Suppose $a_1, a_2, \ldots, a_n$ and $b_1, b_2, \ldots, b_n$ are real numbers such that \[ (a_1 ^ 2 + a_2 ^ 2 + \cdots + a_n ^ 2 -1)(b_1 ^ 2 + b_2 ^ 2 + \cdots + b_n ^ 2 - 1) > (a_1 b_1 + a_2 b_2 + \cdots + a_n b_n - 1)^2. \] Prove that $a_1 ^ 2 + a_2 ^ 2 + \cdots + a_n ^ 2 > 1$ and $b_1 ^ 2 + b_2 ^ 2 + \cdots + b_n ^ 2 > 1$.

2011 Indonesia TST, 1

For all positive integer $n$, define $f_n(x)$ such that $f_n(x) = \sum_{k=1}^n{|x - k|}$. Determine all solution from the inequality $f_n(x) < 41$ for all positive $2$-digit integers $n$ (in decimal notation).

2015 Baltic Way, 2

Let $n$ be a positive integer and let $a_1,\cdots ,a_n$ be real numbers satisfying $0\le a_i\le 1$ for $i=1,\cdots ,n.$ Prove the inequality \[(1-{a_i}^n)(1-{a_2}^n)\cdots (1-{a_n}^n)\le (1-a_1a_2\cdots a_n)^n.\]

Kyiv City MO 1984-93 - geometry, 1993.10.4

Prove theat for an arbitrary triangle holds the inequality $$a \cos A+ b \cos B + c \cos C \le p ,$$ where $a, b, c$ are the sides of the triangle, $A, B, C$ are the angles, $p$ is the semiperimeter.

2022 China Team Selection Test, 3

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers that are not divisible by each other, i.e. for any $i \neq j$, $a_i$ is not divisible by $a_j$. Show that \[ a_1+a_2+\cdots+a_n \ge 1.1n^2-2n. \] [i]Note:[/i] A proof of the inequality when $n$ is sufficient large will be awarded points depending on your results.

2003 Junior Balkan Team Selection Tests - Romania, 3

Let $n$ be a positive integer. Prove that there are no positive integers $x$ and $y$ such as $\sqrt{n}+\sqrt{n+1} < \sqrt{x}+\sqrt{y} <\sqrt{4n+2} $

2016 India IMO Training Camp, 3

Tags: inequalities
Let a,b,c,d be real numbers satisfying $|a|,|b|,|c|,|d|>1$ and $abc+abd+acd+bcd+a+b+c+d=0$. Prove that $\frac {1} {a-1}+\frac {1} {b-1}+ \frac {1} {c-1}+ \frac {1} {d-1} >0$

2000 Baltic Way, 14

Find all positive integers $n$ such that $n$ is equal to $100$ times the number of positive divisors of $n$.

2008 India Regional Mathematical Olympiad, 2

Prove that there exist two infinite sequences $ \{a_n\}_{n\ge 1}$ and $ \{b_n\}_{n\ge 1}$ of positive integers such that the following conditions hold simultaneously: $ (i)$ $ 0 < a_1 < a_2 < a_3 < \cdots$; $ (ii)$ $ a_n < b_n < a_n^2$, for all $ n\ge 1$; $ (iii)$ $ a_n \minus{} 1$ divides $ b_n \minus{} 1$, for all $ n\ge 1$ $ (iv)$ $ a_n^2 \minus{} 1$ divides $ b_n^2 \minus{} 1$, for all $ n\ge 1$ [19 points out of 100 for the 6 problems]

2019 Bulgaria National Olympiad, 1

Let $f(x)=x^2+bx+1,$ where $b$ is a real number. Find the number of integer solutions to the inequality $f(f(x)+x)<0.$

2018 Estonia Team Selection Test, 10

A sequence of positive real numbers $a_1, a_2, a_3, ... $ satisfies $a_n = a_{n-1} + a_{n-2}$ for all $n \ge 3$. A sequence $b_1, b_2, b_3, ...$ is defined by equations $b_1 = a_1$ , $b_n = a_n + (b_1 + b_3 + ...+ b_{n-1})$ for even $n > 1$ , $b_n = a_n + (b_2 + b_4 + ... +b_{n-1})$ for odd $n > 1$. Prove that if $n\ge 3$, then $\frac13 < \frac{b_n}{n \cdot a_n} < 1$

2011 Today's Calculation Of Integral, 694

Prove the following inequality: \[\int_1^e \frac{(\ln x)^{2009}}{x^2}dx>\frac{1}{2010\cdot 2011\cdot2012}\] created by kunny

2011 Cuba MO, 1

Let $P(x) = x^3 + (t - 1)x^2 - (t + 3)x + 1$. For what values of real $t$ the sum of the squares and the reciprocals of the roots of $ P(x)$ is minimum?

2013 ELMO Shortlist, 6

Tags: inequalities
Let $a, b, c$ be positive reals such that $a+b+c=3$. Prove that \[18\sum_{\text{cyc}}\frac{1}{(3-c)(4-c)}+2(ab+bc+ca)\ge 15. \][i]Proposed by David Stoner[/i]

2010 China Team Selection Test, 1

Assume real numbers $a_i,b_i\,(i=0,1,\cdots,2n)$ satisfy the following conditions: (1) for $i=0,1,\cdots,2n-1$, we have $a_i+a_{i+1}\geq 0$; (2) for $j=0,1,\cdots,n-1$, we have $a_{2j+1}\leq 0$; (2) for any integer $p,q$, $0\leq p\leq q\leq n$, we have $\sum_{k=2p}^{2q}b_k>0$. Prove that $\sum_{i=0}^{2n}(-1)^i a_i b_i\geq 0$, and determine when the equality holds.

2010 Slovenia National Olympiad, 4

Find all non-zero real numbers $x$ such that \[\min \left\{ 4, x+ \frac 4x \right\} \geq 8 \min \left\{ x,\frac 1x\right\} .\]

1978 USAMO, 1

Given that $a,b,c,d,e$ are real numbers such that $a+b+c+d+e=8$, $a^2+b^2+c^2+d^2+e^2=16$. Determine the maximum value of $e$.

2013 Junior Balkan Team Selection Tests - Romania, 1

If $a, b, c > 0$ satisfy $a + b + c = 3$, then prove that $$\frac{a^2(b + 1)}{ ab + a + b} + \frac{b^2(c + 1)}{ bc + b + c} + \frac{c^2(a + 1)}{ ca + c + a} \ge 2$$ Mathematical Excalibur P322/Vol.14, no.2

2015 IFYM, Sozopol, 3

Tags: inequalities
Let $ a,b,c>0$ prove that:\[ \frac{a^{3}}{(a+b)^{3}}+\frac{b^{3}}{(b+c)^{3}}+\frac{c^{3}}{(c+a)^{3}}\geq \frac{3}{8} \] Good luck! :D

2002 Putnam, 3

Show that for all integers $n>1$, \[ \dfrac {1}{2ne} < \dfrac {1}{e} - \left( 1 - \dfrac {1}{n} \right)^n < \dfrac {1}{ne}. \]

2014 JBMO Shortlist, 6

Tags: inequalities
Let $a,b,c$ be positive real numbers. Prove that \[\left((3a^2+1)^2+2\left(1+\frac{3}{b}\right)^2\right)\left((3b^2+1)^2+2\left(1+\frac{3}{c}\right)^2\right)\left((3c^2+1)^2+2\left(1+\frac{3}{a}\right)^2\right)\geq 48^3\]

2005 Korea National Olympiad, 6

Tags: inequalities
Real numbers $x_1, x_2, x_3, \cdots , x_n$ satisfy $x_1^2 + x_2^2 + x_3^2 + \cdots + x_n^2 = 1$. Show that \[ \frac{x_1}{1+x_1^2}+\frac{x_2}{1+x_1^2+x_2^2}+\cdots+\frac{x_n}{1+ x_1^2 + x_2^2 + x_3^2 + \cdots + x_n^2} < \sqrt{\frac n2} . \]

2010 AMC 10, 11

Tags: inequalities
The length of the interval of solutions of the inequality $ a\le 2x\plus{}3\le b$ is $ 10$. What is $ b\minus{}a$? $ \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 10 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 20 \qquad \textbf{(E)}\ 30$

2012 China Team Selection Test, 2

Given an integer $k\ge 2$. Prove that there exist $k$ pairwise distinct positive integers $a_1,a_2,\ldots,a_k$ such that for any non-negative integers $b_1,b_2,\ldots,b_k,c_1,c_2,\ldots,c_k$ satisfying $a_1\le b_i\le 2a_i, i=1,2,\ldots,k$ and $\prod_{i=1}^{k}b_i^{c_i}<\prod_{i=1}^{k}b_i$, we have \[k\prod_{i=1}^{k}b_i^{c_i}<\prod_{i=1}^{k}b_i.\]

1992 IberoAmerican, 3

In a triangle $ABC$, points $A_{1}$ and $A_{2}$ are chosen in the prolongations beyond $A$ of segments $AB$ and $AC$, such that $AA_{1}=AA_{2}=BC$. Define analogously points $B_{1}$, $B_{2}$, $C_{1}$, $C_{2}$. If $[ABC]$ denotes the area of triangle $ABC$, show that $[A_{1}A_{2}B_{1}B_{2}C_{1}C_{2}] \geq 13 [ABC]$.