Determine the number of pairs of natural numbers $(a,b)$ that simultaneously verify that $4620$ is a multiple of $a$, $4620$ is a multiple of $b$ and $b$ is a multiple of $a$.

Let \( ABC \) be a scalene triangle. Let \( E \) and \( F \) be the midpoints of sides \( AC \) and \( AB \), respectively, and let \( D \) be any point on segment \( BC \). The circumcircles of triangles \( BDF \) and \( CDE \) intersect line \( EF \) at points \( K \neq F \), and \( L \neq E \), respectively, and intersect at points \( X \neq D \). The point \( Y \) is on line \( DX \) such that \( AY \) is parallel to \( BC \). Prove that points \( K \), \( L \), \( X \), and \( Y \) lie on the same circle.

In a finite, simple, connected graph $G$ we play the following game: initially we color all the vertices with a different color. In each step we choose a vertex randomly (with uniform distribution), and then choose one of its neighbors randomly (also with uniform distribution), and color it to the the same color as the originally chosen vertex (if the two chosen vertices already have the same color, we do nothing). The game ends when all the vertices have the same color. Knowing graph $G$ find the probability for each vertex that the game ends with all vertices having the same color as the chosen vertex.

Let $ABC$ be an acute triangle such that $CA \neq CB$ with circumcircle $\omega$ and circumcentre $O$. Let $t_A$ and $t_B$ be the tangents to $\omega$ at $A$ and $B$ respectively, which meet at $X$. Let $Y$ be the foot of the perpendicular from $O$ onto the line segment $CX$. The line through $C$ parallel to line $AB$ meets $t_A$ at $Z$. Prove that the line $YZ$ passes through the midpoint of the line segment $AC$. [i]Proposed by Dominic Yeo, United Kingdom[/i]

A $10 \times 10 \times 10$ cube is made up up from $500$ white unit cubes and $500$ black unit cubes, arranged in such a way that every two unit cubes that shares a face are in different colors. A line is a $1 \times 1 \times 10$ portion of the cube that is parallel to one of cube’s edges. From the initial cube have been removed $100$ unit cubes such that $300$ lines of the cube has exactly one missing cube. Determine if it is possible that the number of removed black unit cubes is divisible by $4$.

Suppose each element $i\in S=\{1,2,\ldots,n\}$ is assigned a nonempty set $S_i\subseteq S$ so that the following conditions are fulfilled: (i) for any $i,j\in S$, if $j\in S_i$ then $i\in S_j$; (ii) for any $i,j\in S$, if $|S_i|=|S_j|$ then $S_i\cap S_j=\emptyset$. Prove that there exists $k\in S$ for which $|S_k|=1$.

There are $n>2$ lines given in the plane. No two of the lines are parallel and no three of them intersect at one point. Every point of intersection of these lines is labelled with a natural number between $1$ and $n-1$. Prove that, if and only if $n$ is even, it is possible to assign the labels in such a way that every line has all the numbers from $1$ to $n-1$ at its points of intersection with the other $n-1$ lines.

$B$ is the center of unit circle. $A,C$ are points on the circle (the order of $A,B,C$ is clockwise), and $\angle ABC=2\alpha(0<\alpha<\frac{\pi}{3})$. Then we will rotate $\triangle ABC$ anticlockwise. In the first rotation, $A$ is the center of rotation, the result is that $B$ is on the circle. In the second rotation, $B$ is the center of rotation, the result is that $C$ is on the circle. In the third rotation, $C$ is the center of rotation, the result is that $A$ is on the circle. ... After we rotate for $100$ times, the distance $A$ travelled is $\text{(A)}22\pi(1+\sin\alpha)-66\alpha\qquad\text{(B)}\frac{67}{3}\pi\qquad\text{(C)}22\pi+\frac{68}{3}\pi\sin\alpha-66\alpha\qquad\text{(D)}33\pi-66\alpha$

Which regular polygon can be obtained (and how) by cutting a cube with a plane ?

For each pair of even natural numbers $ k $, $ m $determine all real numbers $ x $that satisfy the equation $$ (\sin x)^k + (\cos x)^{-m} = (\cos x)^k + (\sin x)^{-m}$$

Prove that one can find infinite number of distinct pairs of integers such that every digit of each number is no less than $7$ and the product of two numbers in each pair is also a number with all its digits being no less than $7$. (6)

In a $999 \times 999$ square table some cells are white and the remaining ones are red. Let $T$ be the number of triples $(C_1,C_2,C_3)$ of cells, the first two in the same row and the last two in the same column, with $C_1,C_3$ white and $C_2$ red. Find the maximum value $T$ can attain. [i]Proposed by Merlijn Staps, The Netherlands[/i]

Points $ B$ and $ C$ lie on $ \overline{AD}$. The length of $ \overline{AB}$ is $ 4$ times the length of $ \overline{BD}$, and the length of $ \overline{AC}$ is $ 9$ times the length of $ \overline{CD}$. The length of $ \overline{BC}$ is what fraction of the length of $ \overline{AD}$? $ \textbf{(A)}\ \frac{1}{36} \qquad \textbf{(B)}\ \frac{1}{13} \qquad \textbf{(C)}\ \frac{1}{10} \qquad \textbf{(D)}\ \frac{5}{36} \qquad \textbf{(E)}\ \frac{1}{5}$

Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying \[f\big(f(m)+n\big)+f(m)=f(n)+f(3m)+2014\] for all integers $m$ and $n$. [i]Proposed by Netherlands[/i]

We take $100$ consecutive natural numbers $a_{1},$ $a_{2},$ $...,$ $a_{100}.$ Determine the last two digits of the number $a_{1}^{8}+a_{2}^{8}+...+a_{100}^{8}.$