Prove that $\sqrt1+ \sqrt2+\sqrt3+...+ \sqrt{n^2-1}+\sqrt{n^2} \ge \frac{2n^3+n}{3}$ for any positive integer $n$.

Let $ABC$ be a given triangle. The circumcircle of the triangle has radius $R$, the incircle has radius $r$, the longest side of the triangle is $a$, while the shortest altitude is $h$. Show that: $\frac{R}{r} > \frac{a}{h}$.

Let $n\geq1$ be an integer. We have two sequences, each of $n$ positive real numbers $a_1,a_2,\ldots ,a_n$ and $b_1,b_2,\ldots ,b_n$ such that $a_1+a_2+\ldots +a_n=1$ and $ b_1+b_2+\ldots +b_n=1$. Find the smallest possible value that the sum can take $$\frac{a_1^2}{a_1+b_1}+\frac{a_2^2}{a_2+b_2}+\ldots +\frac{a_n^2}{a_n +b_n}.$$

Let $n$ be a positive integer. The numbers $\{1, 2, ..., n^2\}$ are placed in an $n \times n$ grid, each exactly once. The grid is said to be [i]Muirhead-able[/i] if the sum of the entries in each column is the same, but for every $1 \le i,k \le n-1$, the sum of the first $k$ entries in column $i$ is at least the sum of the first $k$ entries in column $i+1$. For which $n$ can one construct a Muirhead-able array such that the entries in each column are decreasing? [i]Proposed by Evan Chen[/i]

Let $a, b, c > 0$ be real numbers with $abc = 1$. Show $$1 + ab + bc + ca \ge \min \left\{ \frac{(a + b)^2}{ab} , \frac{(b+c)^2}{bc} , \frac{(c + a)^2}{ca}\right\}.$$ When does equality holds?

Let $0 < a < \frac{\pi}{2}$ and $x_1,x_2,...,x_n$ be real numbers such that $\sin x_1 + \sin x_2 +... + \sin x_n \ge n \cdot sin a $. Prove that $\sin (x_1 - a) + \sin (x_2 - a) + ... + \sin (x_n - a) \ge 0$ .

Assume $m\times n$ matrix which is filled with just 0, 1 and any two row differ in at least $n/2$ members, show that $m \leq 2n$. ( for example the diffrence of this two row is only in one index 110 100) [i]Edited by Myth[/i]

Let $\{a_n\}_{n=1}^{\infty}$ be a sequence of positive integers for which \[ a_{n+2} = \left[\frac{2a_n}{a_{n+1}}\right]+\left[\frac{2a_{n+1}}{a_n}\right]. \] Prove that there exists a positive integer $m$ such that $a_m=4$ and $a_{m+1} \in\{3,4\}$. [b]Note.[/b] $[x]$ is the greatest integer not exceeding $x$.

This ISL 2005 problem has not been used in any TST I know. A pity, since it is a nice problem, but in its shortlist formulation, it is absolutely incomprehensible. Here is a mathematical restatement of the problem: Let $k$ be a nonnegative integer. A forest consists of rooted (i. e. oriented) trees. Each vertex of the forest is either a leaf or has two successors. A vertex $v$ is called an [i]extended successor[/i] of a vertex $u$ if there is a chain of vertices $u_{0}=u$, $u_{1}$, $u_{2}$, ..., $u_{t-1}$, $u_{t}=v$ with $t>0$ such that the vertex $u_{i+1}$ is a successor of the vertex $u_{i}$ for every integer $i$ with $0\leq i\leq t-1$. A vertex is called [i]dynastic[/i] if it has two successors and each of these successors has at least $k$ extended successors. Prove that if the forest has $n$ vertices, then there are at most $\frac{n}{k+2}$ dynastic vertices.

Let $a$ be some positive number. Find the number of integer solutions $x$ of inequality $2 < xa < 3$ given that inequality $1 < xa < 2$ has exactly $3$ integer solutions. Consider all possible cases. [i](4 points)[/i]

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

Fix two positive integers $a,k\ge2$, and let $f\in\mathbb{Z}[x]$ be a nonconstant polynomial. Suppose that for all sufficiently large positive integers $n$, there exists a rational number $x$ satisfying $f(x)=f(a^n)^k$. Prove that there exists a polynomial $g\in\mathbb{Q}[x]$ such that $f(g(x))=f(x)^k$ for all real $x$. [i]Victor Wang.[/i]

Find the minimum value of the expression $f(a, b, c) = (a + b)^4 + (b + c)^4 + (c + a)^4 - \frac47 (a^4 + b^4 + c^4)$, as $a, b, c$ varies over the set of all real numbers

Let $u_0, u_1, u_2, \ldots$ be integers such that $u_0 = 100$; $u_{k+2} \geqslant 2 + u_k$ for all $k \geqslant 0$; and $u_{\ell+5} \leqslant 5 + u_\ell$ for all $\ell \geqslant 0$. Find all possible values for the integer $u_{2023}$.

A polynomial $P$ with integer coefficients has at least $13$ distinct integer roots. Prove that if an integer $n$ is not a root of $P$, then $|P(n)| \geq 7 \cdot 6!^2$, and give an example for equality.

Let $ a, b, c $ be the side length of a triangle, with $ ab + bc + ca = 18 $ and $ a, b, c > 1 $. Prove that $$ \sum_{cyc}\frac{1}{(a - 1)^3} > \frac{1}{a + b + c - 3} $$

We have $0\le x_i<b$ for $i=0,1,\ldots,n$ and $x_n>0,x_{n-1}>0$. If $a>b$, and $x_nx_{n-1}\ldots x_0$ represents the number $A$ base $a$ and $B$ base $b$, whilst $x_{n-1}x_{n-2}\ldots x_0$ represents the number $A'$ base $a$ and $B'$ base $b$, prove that $A'B<AB'$.

Prove that if $A,B,$ and $C$ are angles of a triangle measured in radians then $A \cos B +\sin A \cos C >0.$

For all positive real numbers $a,b,c,d$ prove the inequality \[\sqrt{a^4+c^4}+\sqrt{a^4+d^4}+\sqrt{b^4+c^4}+\sqrt{b^4+d^4} \ge 2\sqrt{2}(ad+bc)\]

Let $a_1,a_2,a_3, \cdots $ be distinct positive integers, and $0<c<\frac{3}{2}$ . Prove that : There exist infinitely many positive integers $k$, such that $[a_k,a_{k+1}]>ck $.

Prove that for all positive integers $n$, \[\lfloor \sqrt[3]{n}+\sqrt[3]{n+1}\rfloor =\lfloor \sqrt[3]{8n+3}\rfloor.\]

Let $f:[0,1]\to\mathbb R$ be a continuously differentiable function such that $f(x_0)=0$ for some $x_0\in[0,1]$. Prove that $$\int^1_0f(x)^2dx\le4\int^1_0f’(x)^2dx.$$

Prove that $$\sqrt{x-1}+\sqrt{2x+9}+\sqrt{19-3x}<9$$ for all real $x$ for which the left-hand side is well defined.

Let $a,b,c,d >0$ and $abcd=1$. Prove that: \[ \frac{1}{(1+a)^2}+\frac{1}{(1+b)^2}+\frac{1}{(1+c)^2}+\frac{1}{(1+d)^2} \geq 1 \]

Is there a sequence $ a_1,a_2,\ldots$ of positive reals satisfying simoultaneously the following inequalities for all positive integers $ n$: a) $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le n^2$ b) $ \frac1{a_1}\plus{}\frac1{a_2}\plus{}\ldots\plus{}\frac1{a_n}\le2008$?