Suppose a table with one row and infinite columns. We call each $1\times1$ square a [i]room[/i]. Let the table be finite from left. We number the rooms from left to $\infty$. We have put in some rooms some coins (A room can have more than one coin.). We can do $2$ below operations: $a)$ If in $2$ adjacent rooms, there are some coins, we can move one coin from the left room $2$ rooms to right and delete one room from the right room. $b)$ If a room whose number is $3$ or more has more than $1$ coin, we can move one of its coins $1$ room to right and move one other coin $2$ rooms to left. $i)$ Prove that for any initial configuration of the coins, after a finite number of movements, we cannot do anything more. $ii)$ Suppose that there is exactly one coin in each room from $1$ to $n$. Prove that by doing the allowed operations, we cannot put any coins in the room $n+2$ or the righter rooms.

Does there exist a real number $r$ such that the equation $$x^3-2023x^2-2023x+r=0$$ has three distinct rational roots?

The area of the quadrilateral with vertices at the four points in three dimensional space $(0,0,0)$, $(2,6,1)$, $(-3,0,3)$ and $(-4,2,5)$ is the number $\dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

An integer is called snakelike if its decimal representation $a_1a_2a_3\cdots a_k$ satisfies $a_i<a_{i+1}$ if $i$ is odd and $a_i>a_{i+1}$ if $i$ is even. How many snakelike integers between 1000 and 9999 have four distinct digits?

Are there $4$ distinct positive integers such that adding the product of any two of them to $2006$ yields a perfect square?

Ten distinct numbers are chosen at random from the set $\{1, 2, 3, ... , 37\}$. Show that one can select four distinct numbers out of those ten so that the sum of two of them is equal to the sum of the other two.

Let $a,b,c $ be real numbers and let $x=a+b+c,y=a^2+b^2+c^2,z=a^3+b^3+c^3$ and $S=2x^3-9xy+9z .$ $(a)$ Prove that $S$ is unchanged when $a,b,c$ are replaced by $a+t,b+t,c+t $ , respectively , for any real number $t$. $(b)$ Prove that $ (3y-x^2)^3\ge S^2 .$

Consider a $1 \times 1$ grid of squares. Let $A,B,C,D$ be the vertices of this square, and let $E$ be the midpoint of segment $CD$. Furthermore, let $F$ be the point on segment $BC$ satisfying $BF = 2CF$, and let $P$ be the intersection of lines $AF$ and $BE$. Find $\frac{AP}{PF}$.

For a natural number $n$, $f(n)$ is defined as the number of positive integers less than $n$ which are neither coprime to $n$ nor a divisor of it. Prove that for each positive integer $k$ there exist only finitely many $n$ satisfying $f(n) = k$.

Does there exist a solution in integers for the equation $a^2+b^2+c^2+d^2+e^2=abcde-78$ where $a,b,c,d,e>2022$?

You are given 16 pieces of paper numbered $16, 15, \ldots , 2, 1$ in that order. You want to put them in the order $1, 2, \ldots , 15, 16$ switching only two adjacent pieces of paper at a time. What is the minimum number of switches necessary?

Source: 1976 Euclid Part B Problem 4 ----- The remainder when $f(x)=x^5-2x^4+ax^3-x^2+bx-2$ is divided by $x+1$ is $-7$. When $f(x)$ is divided by $x-2$ the remainder is $32$. Determine the remainder when $f(x)$ is divided by $x-1$.

Find all $x;y\in\mathbb{Z}$ satisfying the following condition: $$x^3=y^4+9x^2$$

Determine the least odd number $a > 5$ satisfying the following conditions: There are positive integers $m_1,m_2, n_1, n_2$ such that $a=m_1^2+n_1^2$, $a^2=m_2^2+n_2^2$, and $m_1-n_1=m_2-n_2.$

A sphere sits inside a cubic box, tangent on all $6$ sides of the box. If a side of the box is $5$, and the volume of the sphere is $x\pi$ , find $x$.

Let $x,y\in\mathbb{R}$ such that $x>2, y>3$. Find the minimum value of $\frac{(x+y)^2}{\sqrt{x^2-4}+\sqrt{y^2-9}}$

Let $ABC$ be a triangle with a right angle at $C$. Let $I$ be the incentre of triangle $ABC$, and let $D$ be the foot of the altitude from $C$ to $AB$. The incircle $\omega$ of triangle $ABC$ is tangent to sides $BC$, $CA$, and $AB$ at $A_1$, $B_1$, and $C_1$, respectively. Let $E$ and $F$ be the reflections of $C$ in lines $C_1A_1$ and $C_1B_1$, respectively. Let $K$ and $L$ be the reflections of $D$ in lines $C_1A_1$ and $C_1B_1$, respectively. Prove that the circumcircles of triangles $A_1EI$, $B_1FI$, and $C_1KL$ have a common point.

For $i = 1,2, \ldots, 1991$, we choose $n_i$ points and write number $i$ on them (each point has only written one number on it). A set of chords are drawn such that: (i) They are pairwise non-intersecting. (ii) The endpoints of each chord have distinct numbers. If for all possible assignments of numbers the operation can always be done, find the necessary and sufficient condition the numbers $n_1, n_2, \ldots, n_{1991}$ must satisfy for this to be possible.

For every $3$-digit natural number $n$ (leading digit of $n$ is nonzero), we consider the number $n_0$ obtained from $n$ eliminating all possible digits that are zero. For example, if $n = 207$, then $n_0 = 27$. Determine the number of three-digit positive integers $n$, for which $n_0$ is a divisor of $n$ different from $n$.

Find all pairs of natural numbers $(k, m)$ such that for any natural $n{}$ the product\[(n+m)(n+2m)\cdots(n+km)\]is divisible by $k!{}$. [i]Proposed by P. Kozhevnikov[/i]

An isosceles trapezoid with bases $a$ and $c$ and altitude $h$ is given. a) On the axis of symmetry of this trapezoid, find all points $P$ such that both legs of the trapezoid subtend right angles at $P$; b) Calculate the distance of $p$ from either base; c) Determine under what conditions such points $P$ actually exist. Discuss various cases that might arise.

Given a real number $a$, the [i]floor[/i] of $a$, written $\lfloor a \rfloor$, is the greatest integer less than or equal to $a$. For how many real numbers $x$ such that $1 \le x \le 20$ is \[ x^2 + \lfloor 2x \rfloor = \lfloor x^2 \rfloor + 2x \, ? \]

A triangle is called a parabolic triangle if its vertices lie on a parabola $y = x^2$. Prove that for every nonnegative integer $n$, there is an odd number $m$ and a parabolic triangle with vertices at three distinct points with integer coordinates with area $(2^nm)^2$.

Three disks of diameter $d$ are touching a sphere in their centers. Besides, every disk touches the other two disks. How to choose the radius $R$ of the sphere in order that axis of the whole figure has an angle of $60^\circ$ with the line connecting the center of the sphere with the point of the disks which is at the largest distance from the axis ? (The axis of the figure is the line having the property that rotation of the figure of $120^\circ$ around that line brings the figure in the initial position. Disks are all on one side of the plane, passing through the center of the sphere and orthogonal to the axis).

Let $ ABCD$ be a trapezoid such that $ AB \parallel CD$ and assume that there are points $ E$ on the line outside the segment $ BC$ and $ F$ on the segment $ AD$ such that $ \angle DAE \equal{} \angle CBF$. Let $ I,J,K$ respectively be the intersection of line $ EF$ and line $ CD$, the intersection of line $ EF$ and line $ AB$, and the midpoint of segment $ EF$. Prove that $ K$ is on the circumcircle of triangle $ CDJ$ if and only if $ I$ is on the circumcircle of triangle $ ABK$. [i]Utari Wijayanti, Bandung[/i]