Prove or disprove that $\forall a,b,c,d \in \mathbb{R}^+$ we have the following inequality: \[3 \leq \frac{4a+b}{a+4b} + \frac{4b+c}{b+4c} + \frac{4c+a}{c+4a} < \frac{33}{4}\]

Let $ABC$ be a triangle. Let $K, L$ and $M$ be points on the sides $BC, AC$ and $AB$, respectively, such that $\frac{|AM|}{|MB|}\cdot \frac{|BK|}{|KC|}\cdot \frac{|CL|}{|LA|} = 1$. Prove that it is possible to choose two triangles out of $ALM, BMK, CKL$ whose inradii sum up to at least the inradius of triangle $ABC$.

Let $ k\geq 1 $ and let $ I_{1},\dots, I_{k} $ be non-degenerate subintervals of the interval $ [0, 1] $. Prove that \[ \sum \frac{1}{\left | I_{i}\cup I_{j} \right |} \geq k^{2} \] where the summation is over all pairs $ (i, j) $ of indices such that $I_i\cap I_j\neq \emptyset$.

Determine the smallest positive integer $n\geq 2$ for which there exists a positive integer $m$ such that $mn$ divides $m^{2023} + n^{2023} + n$.

Consider the equilateral triangle $ABC$ with $|BC| = |CA| = |AB| = 1$. On the extension of side $BC$, we define points $A_1$ (on the same side as B) and $A_2$ (on the same side as C) such that $|A_1B| = |BC| = |CA_2| = 1$. Similarly, we define $B_1$ and $B_2$ on the extension of side $CA$ such that $|B_1C| = |CA| =|AB_2| = 1$, and $C_1$ and $C_2$ on the extension of side $AB$ such that $|C_1A| = |AB| = |BC_2| = 1$. Now the circumcentre of 4ABC is also the centre of the circle that passes through the points $A_1,B_2,C_1,A_2,B_1$ and $C_2$. Calculate the radius of the circle through $A_1,B_2,C_1,A_2,B_1$ and $C_2$. [asy] unitsize(1.5 cm); pair[] A, B, C; A[0] = (0,0); B[0] = (1,0); C[0] = dir(60); A[1] = B[0] + dir(-60); A[2] = C[0] + dir(120); B[1] = C[0] + dir(60); B[2] = A[0] + dir(240); C[1] = A[0] + (-1,0); C[2] = B[0] + (1,0); draw(A[1]--A[2]); draw(B[1]--B[2]); draw(C[1]--C[2]); draw(circumcircle(A[2],B[1],C[2])); dot("$A$", A[0], SE); dot("$A_1$", A[1], SE); dot("$A_2$", A[2], NW); dot("$B$", B[0], SW); dot("$B_1$", B[1], NE); dot("$B_2$", B[2], SW); dot("$C$", C[0], N); dot("$C_1$", C[1], W); dot("$C_2$", C[2], E); [/asy]

Let $f(x)=\prod_{n=1}^{\infty} \left( 1 + \frac{x}{2^n} \right)$. Show that at the point $x=1$, $f(x)$ and all its derivatives are irrational.

Find all functions $f,g$:$R \to R$ such that $f(x+yg(x))=g(x)+xf(y)$ for $x,y \in R$.

A convex $n$-gon is called [i]nice[/i] if its sides are not all the same length, and the sum of the distances of any interior point to the side lines is $1$. Find all integers $n \ge 4$ such that a nice $n$-gon exists .

Find all $10$-digit whole numbers $N$, such that first $10$ digits of $N^2$ coincide with the digits of $N$ (in the same order).

Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$, the remainder is $x + 2$, and when $P(x)$ is divided by the polynomial $x^2 + 1$, the remainder is $2x + 1$. There is a unique polynomial of least degree with these two properties. What is the sum of the squares of the coefficients of that polynomial? $\textbf{(A) } 10 \qquad \textbf{(B) } 13 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 23$

The organizers of a mathematical congress found that if they accomodate any participant in a room the rest can be accomodated in double rooms so that 2 persons living in each room know each other. Prove that every participant can organize a round table on graph theory for himself and an even number of other people so that each participant of the round table knows both his neigbours. [i]Proposed by S. Berlov, S. Ivanov[/i]

Let $x_1,x_2,x_3$ be three positive real roots of the equation $x^3+ax^2+bx+c=0$ $(a,b,c\in R)$ and $x_1+x_2+x_3\leq 1. $ Prove that $$a^3(1+a+b)-9c(3+3a+a^2)\leq 0$$

Construct triangle $ABC$, given $h_a$, $h_b$ (the altitudes from $A$ and $B$), and $m_a$, the median from vertex $A$.

The coefficients of the equation $ ax^2\plus{}bx\plus{}c\equal{}0$, where $ a\ne 0$, satisfy the inequality $ (a\plus{}b\plus{}c)(4a\minus{}2b\plus{}c)<0$. Prove that this equation has $ 2$ real distinct solutions.

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

Let $ABCD$ be a quadrilateral whose diagonals are perpendicular, and let $S$ be the intersection of those diagonals. Let $K, L, M$ and $N$ be the reflections of $S$ on the sides $AB$, $BC$, $CD$ and $DA$ respectively. $BN$ cuts the circumcircle of $\vartriangle SKN$ at $E$ and $BM$ cuts the circumcircle of $\vartriangle SLM$ at $F$. Prove that the quadrilateral $EFLK$ is cyclic.

Exactly $4n$ numbers in set $A= \{ 1,2,3,...,6n \} $ of natural numbers painted in red, all other in blue. Proved that exist $3n$ consecutive natural numbers from $A$, exactly $2n$ of which numbers is red.

Let $ABC$ an acute triangle and $\Gamma$ its circumcircle. The bisector of $BAC$ intersects $\Gamma$ at $M\neq A$. A line $r$ parallel to $BC$ intersects $AC$ at $X$ and $AB$ at $Y$. Also, $MX$ and $MY$ intersect $\Gamma$ again at $S$ and $T$, respectively. If $XY$ and $ST$ intersect at $P$, prove that $PA$ is tangent to $\Gamma$.

Find the minimal number of cells on a $5\times 7$ board that must be painted so that any cell which is not painted has exactly one neighboring (having a common side) painted cell.

Define $a\clubsuit b=a^2b-ab^2$. Which of the following describes the set of points $(x, y)$ for which $x\clubsuit y=y\clubsuit x$? ${ \textbf{(A)}\ \text{a finite set of points} \\ \qquad\textbf{(B)}\ \text{one line} \\ \qquad\textbf{(C)}\ \text{two parallel lines}\\ \qquad\textbf{(D}}\ \text{two intersecting lines}\\ \qquad\textbf{(E)}\ \text{three lines} $

A city is a point on the plane. Suppose there are $n\geq 2$ cities. Suppose that for each city $X$, there is another city $N(X)$ that is strictly closer to $X$ than all the other cities. The government builds a road connecting each city $X$ and its $N(X)$; no other roads have been built. Suppose we know that, starting from any city, we can reach any other city through a series of road. We call a city $Y$ [i]suburban[/i] if it is $N(X)$ for some city $X$. Show that there are at least $(n-2)/4$ suburban cities. [i]Proposed by usjl.[/i]

Let $f(x) = (x - 5)(x - 12)$ and $g(x) = (x - 6)(x - 10)$. Find the sum of all integers $n$ such that $\frac{f(g(n))}{f(n)^2}$ is defined and an integer.

Given [i]Fibonacci[/i] sequence $(F_n),$ and a positive integer $m$, denote $k(m)$ by the smallest positive integer satisfying $F_{n+k(m)}\equiv F_n(\bmod m),$ for all natural numbers $n$. a) Prove that: For all $m_1,m_2\in \mathbb{Z^+}$, we have:$$k([m_1,m_2])=[k(m_1),k(m_2)].$$(Here $[a,b]$ is the least common multiple of $a,b.$) b) Determine $k(2),k(4),k(5),k(10).$

There are $n$ different points $A_1, \ldots , A_n$ in the plain and each point $A_i$ it is assigned a real number $\lambda_i$ distinct from zero in such way that $(\overline{A_i A_j})^2 = \lambda_i + \lambda_j$ for all the $i$,$j$ with $i\neq{}j$} Show that: (1) $n \leq 4$ (2) If $n=4$, then $\frac{1}{\lambda_1} + \frac{1}{\lambda_2} + \frac{1}{\lambda_3}+ \frac{1}{\lambda_4} = 0$

Every officially published book used to have an ISBN code (International Standard Book Number) which consisted of $10$ symbols. Such code looked like this: $$a_1a_2 . . . a_9a_{10}$$ with $a_1, . . . , a_9 \in \{0, 1, . . . , 9\}$ and $a_{10} \in \{0, 1, . . . , 9, X\}$. The symbol $X$ stood for the number $10$. With a valid ISBN code was $$a_1 + 2a2 + . . . + 9a_9 + 10a_{10}$$ a multiple of $11$. Prove the following statements. (a) If one symbol is changed in a valid ISBN code, the result is no valid ISBN code. (b) When two different symbols swap places in a valid ISBN code then the result is not a valid ISBN.