Found problems: 1671
Let $a$, $b$, $c$ be the lengths of the sides of a triangle. Prove that
\[ \sqrt{a+b-c} + \sqrt{b+c-a} + \sqrt{c+a-b} \leq \sqrt{a} + \sqrt{b} + \sqrt{c} \]
and determine when equality occurs.
Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$.
[b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \]
[b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]
Let $P$ be a point in the plane of triangle $ABC$ such that the segments $PA$, $PB$, and $PC$ are the sides of an obtuse triangle. Assume that in this triangle the obtuse angle opposes the side congruent to $PA$. Prove that $\angle BAC$ is acute.
Let $ a,b,c,d $ be four non-negative reals such that $ a+b+c+d = 4 $. Prove that $$ a\sqrt{3a+b+c}+b\sqrt{3b+c+d}+c\sqrt{3c+d+a}+d\sqrt{3d+a+b} \ge 4\sqrt{5} $$
$n$ teams participated in a basketball tournament. Each team has played with each team exactly one game. There was no tie. If in the end of the tournament the $i$-th team has $x_{i}$ wins and $y_{i}$ loses $(1\leq i \leq n)$ prove that:
$\sum_{i=1}^{n} {x_{i}}^2=\sum_{i=1}^{n} {y_{i}}^2$
Let $\alpha,\beta,\gamma$ measures of angles of opposite to the sides of triangle with measures $a,b,c$ respectively.Prove that
$$2(cos^2\alpha+cos^2\beta+cos^2\gamma)\geq \frac{a^2}{b^2+c^2}+\frac{b^2}{a^2+c^2}+\frac{c^2}{a^2+b^2}$$
Let $ a,\, b,\, c$ be side lengths of a triangle and $ a+b+c = 3$. Find the minimum of
\[ a^{2}+b^{2}+c^{2}+\frac{4abc}{3}\]
An integer number $n\geq 2$ and real numbers $x_1<x_2<\cdots < x_n$ are given. $f: \mathbb R \to \mathbb R$ is a function defined as
$$
f(x) = \left |
\dfrac{(x-x_2)(x-x_3)\cdots (x-x_n)}{(x_1-x_2)(x_1-x_3)\cdots (x_1-x_n)}
\right | + \cdots +
\left |
\dfrac{(x-x_1)(x-x_2)\cdots (x-x_{n-1})}{(x_n-x_1)(x_n-x_2)\cdots (x_n-x_{n-1})}
\right |.
$$
Prove that there exists $i\in \{1,2,\cdots,n-1\}$ such that for all $x\in (x_i,x_{i+1})$ one has $f(x)< \sqrt n$.
Proposed by [i]Navid Safaei[/i]
Let $a>0,b>0,c>0$ and $a+b+c=1$. Show the inequality
$$\frac{a^4+b^4}{a^2+b^2}+\frac{b^3+c^3}{b+c} + \frac{2a^2+b^2+2c^2}{2} \geq \frac{1}{2}$$
Find, with proof, the point $P$ in the interior of an acute-angled triangle $ABC$ for which $BL^2+CM^2+AN^2$ is a minimum, where $L,M,N$ are the feet of the perpendiculars from $P$ to $BC,CA,AB$ respectively.
[i]Proposed by United Kingdom.[/i]
Given $a,b$ and $c$ positive real numbers with $ab+bc+ca=1$. Then prove that
$\frac{a^3}{1+9b^2ac}+\frac{b^3}{1+9c^2ab}+\frac{c^3}{1+9a^2bc} \geq \frac{(a+b+c)^3}{18}$
Show that for each natural number $n > 1$
$1 \cdot \sqrt{{n \choose 1}}+ 2 \cdot \sqrt{{n \choose 2}}+...+n \cdot \sqrt{{n \choose n}} <\sqrt{2^{n-1}n^3}$
Let $a,b,c,d$ to be non negative real numbers satisfying $ab+ac+ad+bc+bd+cd=6$. Prove that
\[\dfrac{1}{a^2+1} + \dfrac{1}{b^2+1} + \dfrac{1}{c^2+1} + \dfrac{1}{d^2+1} \ge 2\]
In the coordinate plane the points with both coordinates being rational numbers are called rational points. For any positive integer $n$, is there a way to use $n$ colours to colour all rational points, every point is coloured one colour, such that any line segment with both endpoints being rational points contains the rational points of every colour?
Let $P(x)$ be a polynomial of degree $n > 1$ with integer coefficients and let $k$ be a positive integer. Consider the polynomial $Q(x) = P(P(\ldots P(P(x)) \ldots ))$, where $P$ occurs $k$ times. Prove that there are at most $n$ integers $t$ such that $Q(t) = t$.
Given real numbers $x,y,z$ such that $x+y+z=0$, show that
\[\dfrac{x(x+2)}{2x^2+1}+\dfrac{y(y+2)}{2y^2+1}+\dfrac{z(z+2)}{2z^2+1}\ge 0\]
When does equality hold?
Let $\otimes$ be a binary operation that takes two positive real numbers and returns a positive real number. Suppose further that $\otimes$ is continuous, commutative $(a\otimes b=b\otimes a)$, distributive across multiplication $(a\otimes(bc)=(a\otimes b)(a\otimes c))$, and that $2\otimes 2=4$. Solve the equation $x\otimes y=x$ for $y$ in terms of $x$ for $x>1$.
In the Duma there are 1600 delegates, who have formed 16000 committees of 80 persons each. Prove that one can find two committees having no fewer than four common members.
[i]A. Skopenkov[/i]
Given that $x$ is a real number, compute the minimum possible value of $(x-20)^2 + (x-18)^2$.
The numbers $2, 2, ..., 2$ are written on a blackboard (the number $2$ is repeated $n$ times). One step consists of choosing two numbers from the blackboard, denoting them as $a$ and $b$, and replacing them with $\sqrt{\frac{ab + 1}{2}}$.
$(a)$ If $x$ is the number left on the blackboard after $n - 1$ applications of the above operation, prove that $x \ge \sqrt{\frac{n + 3}{n}}$.
$(b)$ Prove that there are infinitely many numbers for which the equality holds and infinitely many for which the inequality is strict.
Positive real numbers $a, b, c$ satisfy $abc = 1$. Prove that $$\frac{a}{1+b}+\frac{b}{1+c}+\frac{c}{1+a} \ge \frac32$$
Prove that if $a,b,c>0,$ then \[ \frac{ab}{3a+4b+5c}+\frac{bc}{3b+4c+5a}+\frac{ca}{3c+4a+5b}\le \frac{a+b+c}{12}. \]
[i] Nikolai Nikolov[/i]
Let $a,b,c$ be distinct positive real numbers with $abc=1$. Prove that $$\sum_{\text{cyc}} \frac{a^6}{(a-b)(a-c)}>15.$$
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.)
Each of eight boxes contains six balls. Each ball has been colored with one of $n$ colors, such that no two balls in the same box are the same color, and no two colors occur together in more than one box. Determine, with justification, the smallest integer $n$ for which this is possible.