Find the maximum possible value of $k$ for which there exist distinct reals $x_1,x_2,\ldots ,x_k $ greater than $1$ such that for all $1 \leq i, j \leq k$, $$x_i^{\lfloor x_j \rfloor }= x_j^{\lfloor x_i\rfloor}.$$ [i]Proposed by Morteza Saghafian[/i]

A five digit number $n= \overline{abcdc}$. Is such that when divided respectively by $2,3,4,5,6$ the remainders are $a,b,c,d,c$. What is the remainder when $n$ is divided by $100$?

Ana and Bora are each given a sufficiently long paper strip, one with letter $A$ written , and the other with letter $B$. Every minute, one of them (not necessarily one after another) writes either on the left or on the right to the word on his/her strip the word written on the other strip. Prove that the day after, one will be able to cut word on Ana's strip into two words and exchange their places, obtaining a palindromic word.

The point $E$ lies on the base $[AD]$ of the trapezoid $ABCD$. The perimeters of the triangles $ABE, BCE$ and $CDE$ are equal. Prove that $|BC| = |AD|/2$

Consider a triangle $ABC$. Let $A_1$ be the symmetric point of $A$ with respect to the line $BC$, $B_1$ the symmetric point of $B$ with respect to the line $CA$, and $C_1$ the symmetric point of $C$ with respect to the line $AB$. Determine the possible set of angles of triangle $ABC$ for which $A_1B_1C_1$ is equilateral.

Consider a prime number $p\geqslant 11$. We call a triple $a,b,c$ of natural numbers [i]suitable[/i] if they give non-zero, pairwise distinct residues modulo $p{}$. Further, for any natural numbers $a,b,c,k$ we define \[f_k(a,b,c)=a(b-c)^{p-k}+b(c-a)^{p-k}+c(a-b)^{p-k}.\]Prove that there exist suitable $a,b,c$ for which $p\mid f_2(a,b,c)$. Furthermore, for each such triple, prove that there exists $k\geqslant 3$ for which $p\nmid f_k(a,b,c)$ and determine the minimal $k{}$ with this property. [i]Călin Popescu and Marian Andronache[/i]

Let $\alpha, \beta$ and $\gamma$ denote the angles of the triangle $ABC$. The perpendicular bisector of $AB$ intersects $BC$ at the point $X$, the perpendicular bisector of $AC$ intersects it at $Y$. Prove that $\tan(\beta) \cdot \tan(\gamma) = 3$ implies $BC= XY$ (or in other words: Prove that a sufficient condition for $BC = XY$ is $\tan(\beta) \cdot \tan(\gamma) = 3$). Show that this condition is not necessary, and give a necessary and sufficient condition for $BC = XY$.

Yasha writes in the cells of the table $99 \times 99$ all positive integers from 1 to $99^2$ (each number once). Grisha looks at the table and selects several cells, among which there are no two cells sharing a common side, and then sums up the numbers in all selected cells. Find the largest sum Grisha can guarantee to achieve.

Let $m$ and $n$ be natural numbers such that \[A=\frac{(m+3)^{n}+1}{3m}\] is an integer. Prove that $A$ is odd.

The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal. Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.

Let $n > 6$ be a perfect number. Let $p_1^{a_1} \cdot p_2^{a_2} \cdot ... \cdot p_k^{a_k}$ be the prime factorisation of $n$, where we assume that $p_1 < p_2 <...< p_k$ and $a_i > 0$ for all $ i = 1,...,k$. Prove that $a_1$ is even. Remark: An integer $n \ge 2$ is called a perfect number if the sum of its positive divisors, excluding $ n$ itself, is equal to $n$. For example, $6$ is perfect, as its positive divisors are $\{1, 2, 3, 6\}$ and $1+2+3=6$.

What is the least possible value of $ab + bc + ac$ such that $a^2 + b^2 + c^2 = 1$ where $a,b,c$ are real numbers? $ \textbf{a)}\ -1 \qquad\textbf{b)}\ -\dfrac 12 \qquad\textbf{c)}\ -\dfrac 13 \qquad\textbf{d)}\ -\dfrac{1}{2\sqrt 2} \qquad\textbf{e)}\ 0 $

Balls numbered $1,2,3,\ldots$ are deposited in $5$ bins, labeled $A,B,C,D,$ and $E$, using the following procedure. Ball $1$ is deposited in bin $A$, and balls $2$ and $3$ are deposted in $B$. The next three balls are deposited in bin $C$, the next $4$ in bin $D$, and so on, cycling back to bin $A$ after balls are deposited in bin $E$. (For example, $22,23,\ldots,28$ are despoited in bin $B$ at step 7 of this process.) In which bin is ball $2024$ deposited? $\textbf{(A) }A\qquad\textbf{(B) }B\qquad\textbf{(C) }C\qquad\textbf{(D) }D\qquad\textbf{(E) }E$

Show that there is no function $f : \mathbb N \to \mathbb N$ satisfying $f(f(n)) = n + 1$ for each positive integer $n.$

Find all four-digit numbers $\overline{abcd}$ such that they are multiples of $3$ and that $\overline{ab}-\overline{cd}=11$. ($\overline{abcd}$ is a four-digit number; $\overline{ab}$ is a two digit-number as $\overline{cd}$ is).

For which $n$ do the equations have a solution in integers: \begin{eqnarray*}x_1 ^2 + x_2 ^2 + 50 &=& 16x_1 + 12x_2 \\ x_2 ^2 + x_3 ^2 + 50 &=& 16x_2 + 12x_3 \\ \cdots \quad \cdots \quad \cdots & \cdots & \cdots \quad \cdots \\ x_{n-1} ^2 + x_n ^2 + 50 &=& 16x_{n-1} + 12x_n \\ x_n ^2 + x_1 ^2 + 50 &=& 16x_n + 12x_1 \end{eqnarray*}