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

1963 Kurschak Competition, 2

$A$ is an acute angle. Show that $$\left(1 +\frac{1}{sen A}\right)\left(1 +\frac{1}{cos A}\right)> 5$$

1990 Romania Team Selection Test, 8

For a set $S$ of $n$ points, let $d_1 > d_2 >... > d_k > ...$ be the distances between the points. A function $f_k: S \to N$ is called a [i]coloring function[/i] if, for any pair $M,N$ of points in $S$ with $MN \le d_k$ , it takes the value $f_k(M)+ f_k(N)$ at some point. Prove that for each $m \in N$ there are positive integers $n,k$ and a set $S$ of $n$ points such that every coloring function $f_k$ of $S$ satisfies $| f_k(S)| \le m$

2010 Indonesia TST, 4

Prove that for all integers $ m$ and $ n$, the inequality \[ \dfrac{\phi(\gcd(2^m \plus{} 1,2^n \plus{} 1))}{\gcd(\phi(2^m \plus{} 1),\phi(2^n \plus{} 1))} \ge \dfrac{2\gcd(m,n)}{2^{\gcd(m,n)}}\] holds. [i]Nanang Susyanto, Jogjakarta [/i]

2021 Ukraine National Mathematical Olympiad, 8

There are $101$ not necessarily different weights, each of which weighs an integer number of grams from $1$ g to $2020$ g. It is known that at any division of these weights into two heaps, the total weight of at least one of the piles is no more than $2020$. What is the largest number of grams can weigh all $101$ weights? (Bogdan Rublev)

Durer Math Competition CD 1st Round - geometry, 2008.D1

Prove the following inequality if we know that $a$ and $b$ are the legs of a right triangle , and $c$ is the length of the hypotenuse of this triangle: $$3a + 4b \le 5c.$$ When does equality holds?

1997 VJIMC, Problem 3

Let $u\in C^2(\overline D)$, $u=0$ on $\partial D$ where $D$ is the open unit ball in $\mathbb R^3$. Prove that the following inequality holds for all $\varepsilon>0$: $$\int_D|\nabla u|^2dV\le\varepsilon\int_D(\Delta u)^2dV+\frac1{4\varepsilon}\int_Du^2dV.$$(We recall that $\nabla u$ and $\Delta u$ are the gradient and Laplacian, respectively.)

1992 Czech And Slovak Olympiad IIIA, 1

For a permutation $p(a_1,a_2,...,a_{17})$ of $1,2,...,17$, let $k_p$ denote the largest $k$ for which $a_1 +...+a_k < a_{k+1} +...+a_{17}$. Find the maximum and minimum values of $k_p$ and find the sum $\sum_{p} k_p$ over all permutations$ p$.

2002 Tournament Of Towns, 3

In an infinite increasing sequence of positive integers, every term from the $2002^{\text{th}}$ term divides the sum of all preceding terms. Prove that every term starting from some term is equal to the sum of all preceding terms.

2011 Kurschak Competition, 2

Let $n$ be a positive integer. Denote by $a(n)$ the ways of expression $n=x_1+x_2+\dots$ where $x_1\leqslant x_2 \leqslant\dots$ are positive integers and $x_i+1$ is a power of $2$ for each $i$. Denote by $b(n)$ the ways of expression $n=y_1+y_2+\dots$ where $y_i$ is a positive integer and $2y_i\leqslant y_{i+1}$ for each $i$. Prove that $a(n)=b(n)$.

1987 Romania Team Selection Test, 9

Prove that for all real numbers $\alpha_1,\alpha_2,\ldots,\alpha_n$ we have \[ \sum_{i=1}^n \sum_{j=1}^n ij \cos {(\alpha_i - \alpha_j )} \geq 0. \] [i]Octavian Stanasila[/i]

2017 Regional Competition For Advanced Students, 1

Tags: inequalities
Let $x_1, x_2, \dots, x_n$ be non-negative real numbers such that $$x_1^2+x_2^2 + \dots x_9^2 \ge 25.$$ Prove that one can choose three of these numbers such that their sum is at least $5$. [i]Proposed by Karl Czakler[/i]

2011 Belarus Team Selection Test, 2

Positive real $a,b,c$ satisfy the condition $$\frac{a}{b+c}+\frac{b}{a+c}+\frac{c}{a+b}=1+\frac{1}{6}\left( \frac{a}{c}+\frac{b}{a}+\frac{c}{b} \right)$$ Prove that $$\frac{a^3bc}{b+c}+\frac{b^3ca}{a+c}+\frac{c^3ab}{a+b}\ge \frac{1}{6}(ab+bc+ca)^2$$ I.Voronovich

2014 Junior Balkan Team Selection Tests - Romania, 1

Let $a, b, c, d$ be positive real numbers so that $abc+bcd+cda+dab = 4$. Prove that $a^2 + b^2 + c^2 + d^2 \ge 4$

III Soros Olympiad 1996 - 97 (Russia), 11.2

Find the smallest value of the expression: $$y=\frac{x^2}{8}+x \cos x +\cos 2x$$

2019 Taiwan TST Round 1, 1

Tags: inequalities
Assume $ a_{1} \ge a_{2} \ge \dots \ge a_{107} > 0 $ satisfy $ \sum\limits_{k=1}^{107}{a_{k}} \ge M $ and $ b_{107} \ge b_{106} \ge \dots \ge b_{1} > 0 $ satisfy $ \sum\limits_{k=1}^{107}{b_{k}} \le M $. Prove that for any $ m \in \{1,2, \dots, 107\} $, the arithmetic mean of the following numbers $$ \frac{a_{1}}{b_{1}}, \frac{a_{2}}{b_{2}}, \dots, \frac{a_{m}}{b_{m}} $$ is greater than or equal to $ \frac{M}{N} $

2010 Tuymaada Olympiad, 2

In acute triangle $ABC$, let $H$ denote its orthocenter and let $D$ be a point on side $BC$. Let $P$ be the point so that $ADPH$ is a parallelogram. Prove that $\angle DCP<\angle BHP$.

2005 Serbia Team Selection Test, 5

Tags: inequalities
Let $a,b,c$ be positive reals such that $abc=1$ .Prove the inequality $\frac{a}{a^2+2}+\frac{b}{b^2+2}+\frac{c}{c^2+2}\leq 1$

1950 Poland - Second Round, 2

Prove that if $a > 0$, $b > 0$, $abc=1$, then $$a+b+c \ge 3$$

2014 Contests, 3

For all integers $n\ge 2$ with the following property: [list] [*] for each pair of positive divisors $k,~\ell <n$, at least one of the numbers $2k-\ell$ and $2\ell-k$ is a (not necessarily positive) divisor of $n$ as well.[/list]

2016 Korea Winter Program Practice Test, 2

Tags: inequalities
Let $a_i, b_i$ ($1 \le i \le n$, $n \ge 2$) be positive real numbers such that $\sum_{i=1}^n a_i = \sum_{i=1}^n b_i$. Prove that $\sum_{i=1}^n \frac{(a_{i+1}+b_{i+1})^2}{n(a_i-b_i)^2+4(n-1)\sum_{j=1}^n a_jb_j} \ge \frac{1}{n-1}$

1939 Eotvos Mathematical Competition, 1

Let $a_1$, $a_2$, $b_1$, $b_2$, $c_1$ and $c_2$ be real numbers for which $a_1a_2 > 0$, $a_1c_1 \ge b^2_1$ and $a_2c_2 > b^2_2$. Prove that $$(a_1 + a_2)(c_1 + c_2) \ge (b_1 + b_2)^2$$

2021 China Team Selection Test, 5

Let $n$ be a positive integer and $a_1,a_2,\ldots a_{2n+1}$ be positive reals. For $k=1,2,\ldots ,2n+1$, denote $b_k = \max_{0\le m\le n}\left(\frac{1}{2m+1} \sum_{i=k-m}^{k+m} a_i \right)$, where indices are taken modulo $2n+1$. Prove that the number of indices $k$ satisfying $b_k\ge 1$ does not exceed $2\sum_{i=1}^{2n+1} a_i$.

2010 Baltic Way, 3

Let $x_1, x_2, \ldots ,x_n(n\ge 2)$ be real numbers greater than $1$. Suppose that $|x_i-x_{i+1}|<1$ for $i=1, 2,\ldots ,n-1$. Prove that \[\frac{x_1}{x_2}+\frac{x_2}{x_3}+\ldots +\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}<2n-1\]

2022 Puerto Rico Team Selection Test, 6

Let $f$ be a function defined on $[0, 2022]$, such that $f(0) = f(2022) = 2022$, and $$|f(x) - f(y)| \le 2|x -y|,$$ for all $x, y$ in $[0, 2022]$. Prove that for each $x, y$ in $[0, 2022]$, the distance between $f(x)$ and $f(y)$ does not exceed $2022$.

1971 IMO Longlists, 42

Show that for nonnegative real numbers $a,b$ and integers $n\ge 2$, \[\frac{a^n+b^n}{2}\ge\left(\frac{a+b}{2}\right)^n\] When does equality hold?