We consider the non-zero natural numbers $(m, n)$ such that the numbers $$\frac{m^2 + 2n}{n^2 - 2m} \,\,\,\, and \,\,\, \frac{n^2 + 2m}{m^2-2n}$$ are integers. a) Show that $|m - n| \le 2$: b) Find all the pairs $(m, n)$ with the property from hypothesis $a$.

Is there a real number $\alpha$ such that $\cos\alpha$ is irrational but $\cos 2\alpha$, $\cos 3\alpha$, $\cos 4\alpha$, $\cos 5\alpha$ are all rational? (Author: V. Senderov)

Let $n,k \in \mathbb{Z}^{+}$ with $k \leq n$ and let $S$ be a set containing $n$ distinct real numbers. Let $T$ be a set of all real numbers of the form $x_1 + x_2 + \ldots + x_k$ where $x_1, x_2, \ldots, x_k$ are distinct elements of $S.$ Prove that $T$ contains at least $k(n-k)+1$ distinct elements.

Find all functions $f:\mathbb{N}_0\to\mathbb{N}$ such that [b]1)[/b] \(f(a)\) divides \(a\) for every \(a\in\mathbb{N}_0\), and [b]2)[/b] for all \(a,b,k\in\mathbb{N}_0\) we have \[ f\bigl(f(a)+kb\bigr)\;=\;f\bigl(a + k\,f(b)\bigr). \]

Right isosceles triangle $T$ is placed in the first quadrant of the coordinate plane. Suppose that the projection of $T$ onto the $x$-axis has length $6$, while the projection of $T$ onto the $y$-axis has length $8$. What is the sum of all possible areas of the triangle $T$? [asy] import olympiad; size(120); defaultpen(linewidth(0.8)); pair A = (0.9,0.6), B = (1.7, 0.8), C = rotate(270, B)*A; pair PAx = (A.x,0), PBx = (B.x,0), PAy = (0, A.y), PCy = (0, C.y); draw(PAx--A--PAy^^PCy--C^^PBx--B, linetype("4 4")); draw(rightanglemark(A,B,C,3)); draw(A--B--C--cycle); draw((0,2)--(0,0)--(2,0),Arrows(size=8)); label("$6$",(PAx+PBx)/2,S); label("$8$",(PAy+PCy)/2,W); [/asy]

Let $ABC$ be a triangle and the points $M$ and $N$ on the sides $AB$ respectively $BC$, such that $2 \cdot \frac{CN}{BC} = \frac{AM}{AB}$. Let $P$ be a point on the line $AC$. Prove that the lines $MN$ and $NP$ are perpendicular if and only if $PN$ is the interior angle bisector of $\angle MPC$.

Let ${ABC}$ be an acute angled triangle, and ${H}$ a point in its interior. Let the reflections of ${H}$ through the sides ${AB}$ and ${AC}$ be called ${H_{c} }$ and ${H_{b} }$ , respectively, and let the reflections of H through the midpoints of these same sidesbe called ${H_{c}^{'} }$ and ${H_{b}^{'} }$, respectively. Show that the four points ${H_{b}, H_{b}^{'} , H_{c}}$, and ${H_{c}^{'} }$ are concyclic if and only if at least two of them coincide or ${H}$ lies on the altitude from ${A}$ in triangle ${ABC}$.

Let $p$ and $n$ be a natural numbers such that $p$ is a prime and $1+np$ is a perfect square. Prove that the number $n+1$ is sum of $p$ perfect squares.

Find the greatest integer $n$ such that $10^n$ divides $$\frac{2^{10^5} 5^{2^{10}}}{10^{5^2}}$$

Maria buys computer disks at a price of 4 for 5 dollars and sells them at a price of 3 for 5 dollars. How many computer disks must she sell in order to make a profit of 100 dolars? $ \text{(A)}\ 100\qquad\text{(B)}\ 120\qquad\text{(C)}\ 200\qquad\text{(D)}\ 240\qquad\text{(E)}\ 1200 $

The winners of first AGMC in 2019 gifts the person in charge of the organiser, which is a polyhedron formed by $60$ congruent triangles. From the photo, we can see that this polyhedron formed by $60$ quadrilateral spaces. (Note: You can find the photo in 3.4 of [url]https://files.alicdn.com/tpsservice/18c5c7b31a7074edc58abb48175ae4c3.pdf?spm=a1zmmc.index.0.0.51c0719dNAbw3C&file=18c5c7b31a7074edc58abb48175ae4c3.pdf[/url]) A quadrilateral space is the plane figures that we fold the figures following the diagonal on a $n$ sides on a plane (i.e. form an appropriate dihedral angle in where the chosen diagonal is). "Two figure spaces are congruent" means they can coincide completely by isometric transform in $\mathbb{R}^3$. A polyhedron is the bounded space region, whose boundary is formed by the common edge of finite polygon. (a) We know that $2021=43\times 47$. Does there exist a polyhedron, whose surface can be formed by $43$ congruent $47$-gon? (b) Prove your answer in (a) with logical explanation.

Let $n > 1$ be a fixed integer. On an infinite row of squares, there are $n$ stones on square $1$ and no stones on squares $2$, $3$, $4$, $\ldots$. Curious George plays a game in which a [i]move[/i] consists of taking two adjacent piles of sizes $a$ and $b$, where $a-b$ is a nonzero even integer, and transferring stones to equalize the piles (so that both piles have $\frac{a+b}{2}$ stones). The game ends when no more moves can be made. George wants to analyze the number of moves it takes to end the game. (a) Suppose George wants to end the game as quickly as possible. How many moves will it take him? (b) Suppose George wants to end the game as slowly as possible. Show that for all $n > 2$, the game will end after at most $\frac{3}{16}n^2$ moves. [i]Scoring note:[/i] For part (b), partial credit will be awarded for correct proofs of weaker bounds, eg. $\frac{1}{4}n^2$, $n^k$, or $k^n$ (for some $k \geq 2$).

Let $A$ and $E$ be opposite vertices of an octagon. A frog starts at vertex $A.$ From any vertex except $E$ it jumps to one of the two adjacent vertices. When it reaches $E$ it stops. Let $a_n$ be the number of distinct paths of exactly $n$ jumps ending at $E$. Prove that: \[ a_{2n-1}=0, \quad a_{2n}={(2+\sqrt2)^{n-1} - (2-\sqrt2)^{n-1} \over\sqrt2}. \]

Prove that for every positive integer $m$ we can find a finite set $S$ of points in the plane, such that given any point $A$ of $S$, there are exactly $m$ points in $S$ at unit distance from $A$.

Let $ABCD$ be a square of side length $1$, and let $P_1, P_2$ and $P_3$ be points on the perimeter such that $\angle P_1P_2P_3 = 90^\circ$ and $P_1, P_2, P_3$ lie on different sides of the square. As these points vary, the locus of the circumcenter of $\triangle P_1P_2P_3$ is a region $\mathcal{R}$; what is the area of $\mathcal{R}$?

A convex $n{}$-gon with $n > 4$ is such that if a diagonal cuts a triangle from it then this triangle is isosceles. Prove that there are at least 2 equal sides among any 4 sides of the $n{}$-gon. [i]Maxim Didin[/i]

Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible. [i]Carl Schildkraut, USA[/i]

Let a right cone of the base radius $r=3$ and height greater than $6$ be inscribed in a sphere of radius $R=6$. The volume of the cone can be expressed as $\pi(a\sqrt{b}+c)$, where $b$ is square free. Find $a+b+c$.

Let $ABC$ be a right triangle with hypotenuse $AC$. Let $G$ be the centroid of this triangle and suppose that we have $AG^2 + BG^2 + CG^2 = 156$. Find $AC^2$.

Find all pairs of integers $(x,y)$ that satisfy the equation $3^4 2^3(x^2+y^2)=x^3y^3$

Let $ABC$ is a triangle with $\angle BAC=\frac{\pi}{6}$ and the circumradius equal to 1. If $X$ is a point inside or in its boundary let $m(X)=\min(AX,BX,CX).$ Find all the angles of this triangle if $\max(m(X))=\frac{\sqrt{3}}{3}.$

For a given integer $k \geq 1$, find all $k$-tuples of positive integers $(n_1,n_2,...,n_k)$ with $\text{GCD}(n_1,n_2,...,n_k) = 1$ and $n_2|(n_1+1)^{n_1}-1$, $n_3|(n_2+1)^{n_2}-1$, ... , $n_1|(n_k+1)^{n_k}-1$. [i]Authored by Pavel Dimovski[/i]

Given a sequence $(a_n)$ of non-negative real numbers such that $a_{n+m}\leq a_{n} a_{m} $ for all pairs of positive integers $m$ and $n,$ prove that the sequence $(\sqrt[n]{a_n })$ converges.

Suppose that $m$ and $k$ are positive integers. Determine the number of sequences $x_1, x_2, x_3, \dots , x_{m-1}, x_m$ with [list] [*]$x_i$ an integer for $i = 1, 2, 3, \dots , m$, [*]$1\le x_i \le k$ for $i = 1, 2, 3, \dots , m$, [*]$x_1\neq x_m$, and [*]no two consecutive terms equal.[/list]

Find the smallest positive integer $x$ such that $x^2$ ends with the four digits $9009$.