Let $a_1, a_2, . . . , a_n$ be positive integers, with $n \ge 2$, such that $$ \lfloor \sqrt{a_1 \cdot a_2\cdot\cdot\cdot a_n} \rfloor = \lfloor \sqrt{a_1} \rfloor \cdot \lfloor \sqrt{a_2} \rfloor \cdot\cdot\cdot \lfloor \sqrt{a_n} \rfloor.$$ Prove that at least $n - 1$ of these numbers are perfect squares. Clarification: Given a real number $x$, $\lfloor x\rfloor$ denotes the largest integer that is less than or equal to $x$. For example $\lfloor \sqrt2\rfloor$ and $\lfloor 3\rfloor =3$.

Show that a segment of length $ h$ can go through or be tangent to at most $ 2\lfloor h/\sqrt{2}\rfloor\plus{}2$ nonoverlapping unit spheres. [i]L.Fejes-Toth, A. Heppes[/i]

What is the least number of moves it takes a knight to get from one corner of an $n\times n$ chessboard, where $n\ge 4$, to the diagonally opposite corner?

Let $a, b$ and $c$ be real numbers such that $$\lceil a \rceil + \lceil b \rceil + \lceil c \rceil + \lfloor a + b \rfloor + \lfloor b + c \rfloor + \lfloor c + a \rfloor = 2020$$ Prove that $$\lfloor a \rfloor + \lfloor b \rfloor + \lfloor c \rfloor + \lceil a + b + c \rceil \ge 1346$$ Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$, and $\lceil x \rceil$ is the smallest integer greater than or equal to $x$. That is, $\lfloor x \rfloor$ is the unique integer satisfying $\lfloor x \rfloor \le x < \lfloor x \rfloor + 1$, and $\lceil x \rceil$ is the unique integer satisfying $\lceil x \rceil - 1 < x \le \lceil x \rceil$. [i]Proposed by Ariel García[/i]

Suppose $a$ is a real number such that $3a + 6$ is the greatest integer less than or equal to $a$ and $4a + 9$ is the least integer greater than or equal to $a$. Compute $a$.

Find all real solutions $x$ to the equation $\lfloor x^2 - 2x \rfloor + 2\lfloor x \rfloor = \lfloor x \rfloor^2$.

Let $n$ be an integer greater than $1$. Define \[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\] where $[z]$ denotes the largest integer less than or equal to $z$. Prove that \[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]

Find the integer represented by $\left[ \sum_{n=1}^{10^9} n^{-2/3} \right] $. Here $[x]$ denotes the greatest integer less than or equal to $x.$

Consider the numbers $a,b, \alpha, \beta \in \mathbb{R}$ and the sets $$A=\left \{x \in \mathbb{R} : x^2+a|x|+b=0 \right \},$$ $$B=\left \{ x \in \mathbb{R} : \lfloor x \rfloor^2 + \alpha \lfloor x \rfloor + \beta = 0\right \}.$$ If $A \cap B$ has exactly three elements, prove that $a$ cannot be an integer.

If $p$ is an odd prime, prove that \[{k \choose p}\equiv \left\lfloor \frac{k}{p}\right\rfloor \pmod{p}.\]

Let $p$ be a prime with $p>5$, and let $S=\{p-n^2 \vert n \in \mathbb{N}, {n}^{2}<p \}$. Prove that $S$ contains two elements $a$ and $b$ such that $a \vert b$ and $1<a<b$.

Determine all real-coefficient polynomials $P(x)$ such that \[ P(\lfloor x \rfloor) = \lfloor P(x) \rfloor \]for every real numbers $x$.

If $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$, then \[\displaystyle\sum_{N=1}^{1024} \lfloor \log_{2}N\rfloor = \] $ \textbf{(A)}\ 8192\qquad\textbf{(B)}\ 8204\qquad\textbf{(C)}\ 9218\qquad\textbf{(D)}\ \lfloor \log_{2}(1024!)\rfloor\qquad\textbf{(E)}\ \text{none of these} $

Solve the system of equations $$\begin{cases} x^2+ [y]=10 \\ y^2+[x]=13 \end{cases}$$ ($[x]$ is the integer part of $x$, $[x]$ is equal to the largest integer not exceeding $x$. For example, $[3,33] = 3$, $[2] = 2$, $[- 3.01] = -4$).

There are $ 1993$ towns in a country, and at least $ 93$ roads going out of each town. It's known that every town can be reached from any other town. Prove that this can always be done with no more than $ 62$ transfers.