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: 2529

Let $G = (S, T; E)$ be a finite bipartite graph with a perfect matching. Prove that there exists an injective edge weighting $w: E \to \mathbb{R}$ satisfying the following: 1. If $e_s$ is the edge with the smallest weight among the edges incident to $s$ for all $s \in S$, then $\{ e_s \mid s \in S \}$ forms a perfect matching in $G$. 2. If $e_t$ is the edge with the largest weight among the edges incident to $t$ for all $t \in T$, then $\{ e_t \mid t \in T \}$ forms a perfect matching in $G$.
Let $a, b, c $ be positive real numbers such that $abc = \frac {2} {3}. $ Prove that: $$\frac {ab}{a + b} + \frac {bc} {b + c} + \frac {ca} {c + a} \geqslant \frac {a+b+c} {a^3+b ^ 3 + c ^ 3}.$$
Let $h_a, h_b, h_c$ be the lengths of the altitudes of a triangle $ABC$ from $A, B, C$ respectively. Let $P$ be any point inside the triangle. Show that \[\frac{PA}{h_b+h_c} + \frac{PB}{h_a+h_c} + \frac{PC}{h_a+h_b} \ge 1.\]
Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\] Define the set $A$ by \[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\] Prove that, if $A$ is not empty, then \[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]
Let $a, b, c$ be positive real numbers such that $a^2 + b^2 + c^2 = 3$. Prove that $$\frac{1}{a}+\frac{3}{b}+\frac{5}{c} \ge 4a^2 + 3b^2 + 2c^2$$ When does the equality hold? Marius Stanean
If $ a$ and $ b$ are two unequal positive numbers, then: $ \textbf{(A)}\ \frac {2ab}{a \plus{} b} > \sqrt {ab} > \frac {a \plus{} b}{2} \qquad\textbf{(B)}\ \sqrt {ab} > \frac {2ab}{a \plus{} b} > \frac {a \plus{} b}{2}$ $ \textbf{(C)}\ \frac {2ab}{a \plus{} b} > \frac {a \plus{} b}{2} > \sqrt {ab} \qquad\textbf{(D)}\ \frac {a \plus{} b}{2} > \frac {2ab}{a \plus{} b} > \sqrt {ab}$ $ \textbf{(E)}\ \frac {a \plus{} b}{2} > \sqrt {ab} > \frac {2ab}{a \plus{} b}$
Let $x, y, z$ be positive real numbers such that $\frac{1}{1 + x}+\frac{1}{1 + y}+\frac{1}{1 + z}= 2$. Prove that $8xyz \le 1$.
A circle touches the lateral sides of a trapezoid $ABCD$ at points $B$ and $C$, and its center lies on $AD$. Prove that the diameter of the circle is less than the medial line of the trapezoid.
Prove that \[\frac{1}{3}n^2 + \frac{1}{2}n + \frac{1}{6} \geq (n!)^{\frac{2}{n}},\] and let $n \geq 1$ be an integer. Prove that this inequality is only possible in the case $n = 1.$
Find all pairs of positive integers $\left(n;\;k\right)$ such that $n!=\left( n+1\right)^{k}-1$.
Let $n \ge 3$ be an integer. Find the minimal value of the real number $k_n$ such that for all positive numbers $x_1, x_2, ..., x_n$ with product $1$, we have $$\frac{1}{\sqrt{1 + k_nx_1}}+\frac{1}{\sqrt{1 + k_nx_2}}+ ... + \frac{1}{\sqrt{1 + k_nx_n}} \le n - 1.$$
Let $ a,b,c$ be three pairwise distinct real numbers such that $ a\plus{}b\plus{}c\equal{}6\equal{}ab\plus{}bc\plus{}ca\minus{}3$. Prove that $ 0<abc<4$.
Let $n$ be a positive integer and $N=n^{2021}$. There are $2021$ concentric circles centered at $O$, and $N$ equally-spaced rays are emitted from point $O$. Among the $2021N$ intersections of the circles and the rays, some are painted red while the others remain unpainted. It is known that, no matter how one intersection point from each circle is chosen, there is an angle $\theta$ such that after a rotation of $\theta$ with respect to $O$, all chosen points are moved to red points. Prove that the minimum number of red points is $2021n^{2020}$. [I]Proposed by usjl.[/i]
Let $x,y>0$ be real numbers.Prove that: $$\frac{1}{x^2+y^2} +\frac{1}{x^2}+\frac{1}{y^2}\ge\frac{10}{(x+y)^2}$$ I tried CBS, but it doesn't work... Can you give an idea, please?
Prove that for every real number $x>0$ and each integer $n>0$ we have \[x^n+\frac1{x^n}-2 \ge n^2\left(x+\frac1x-2\right)\]
Let $P$ be a point in the interior of $\triangle ABC$. The lengths of the sides of $\triangle ABC$ is $a,b,c$, and the distance from $P$ to the sides of $\triangle ABC$ is $p,q,r$. Show that the circumradius $R$ of $\triangle ABC$ satisfies \[\displaystyle R\le \frac{a^2+b^2+c^2}{18\sqrt[3]{pqr}}.\] When does equality hold?
Let $a$, $b$, $c$ be positive reals. Prove that \[ \sqrt{\frac{a^2(bc+a^2)}{b^2+c^2}}+\sqrt{\frac{b^2(ca+b^2)}{c^2+a^2}}+\sqrt{\frac{c^2(ab+c^2)}{a^2+b^2}}\ge a+b+c. \][i]Proposed by Robin Park[/i]
An acute triangle $ABC$ is given, $AC \not= BC$. The altitudes drawn from $A$ and $B$ meet at $H$ and intersect the external bisector of the angle $C$ at $Y$ and $X$ respectively. The external bisector of the angle $AHB$ meets the segments $AX$ and $BY$ at $P$ and $Q$ respectively. If $PX = QY$, prove that $AP + BQ \ge 2CH$.
Let $a<b<c<d$ be positive integers which satisfy $ad=bc.$ Prove that $2a+\sqrt{a}+\sqrt{d}<b+c+1.$ [i]Marius Mînea[/i]
$ a,b,c>0 $ and $ abc=1 $. Prove that $\frac{1}{2}\ (\sqrt{a}\ +\sqrt{b}\ + \sqrt{c}\ ) +\frac{1}{1+a}\ + \frac{1}{1+b}\ + \frac{1}{1+c}\ge\ 3 $. ( The official problem is with $ abc = 1 $ but it can be proved without using it. )
Let $n\ge m\ge 1$ be integers. Prove that \[\sum_{k=m}^n \left (\frac 1{k^2}+\frac 1{k^3}\right) \ge m\cdot \left(\sum_{k=m}^n \frac 1{k^2}\right)^2.\] [i]Raymond Feng and Luke Robitaille[/i]
Let $\mathcal{B}$ be the set of rectangular boxes that have volume $23$ and surface area $54$. Suppose $r$ is the least possible radius of a sphere that can fit any element of $\mathcal{B}$ inside it. Then $r^{2}$ can be expressed as $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
Find all real numbers $r$, such that the inequality \[r(ab+bc+ca)+(3-r)\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)\geq 9\] holds for any real $a,b,c>0$.
The positive integers $a_1,a_2, \dots, a_n$ are aligned clockwise in a circular line with $n \geq 5$. Let $a_0=a_n$ and $a_{n+1}=a_1$. For each $i \in \{1,2,\dots,n \}$ the quotient \[ q_i=\frac{a_{i-1}+a_{i+1}}{a_i} \] is an integer. Prove \[ 2n \leq q_1+q_2+\dots+q_n < 3n. \]
Let $a_n, b_n$ be sequences of positive reals such that,$$a_{n+1}= a_n + \frac{1}{2b_n}$$ $$b_{n+1}= b_n + \frac{1}{2a_n}$$ for all $n\in\mathbb N$. Prove that, $\text{max}\left(a_{2018}, b_{2018}\right) >44$.