$A = \{a, b, c\}$ is a set containing three positive integers. Prove that we can find a set $B \subset A$, $B = \{x, y\}$ such that for all odd positive integers $m, n$ we have $$10\mid x^my^n-x^ny^m.$$ [i]Tomi Dimovski[/i]

Let $P_1, P_2, \dots, P_n$ be points on the plane. There is an edge between distinct points $P_x, P_y$ if and only if $x \mid y$. Find the largest $n$, such that the graph can be drawn with no crossing edges.

Find out all the integer pairs $(m,n)$ such that there exist two monic polynomials $P(x)$ and $Q(x)$ ,with $\deg{P}=m$ and $\deg{Q}=n$,satisfy that $$P(Q(t))\not=Q(P(t))$$ holds for any real number $t$.

Find all pairs $(x, y)$ of integers that satisfy $x^2 + y^2 + 3^3 = 456\sqrt{x - y}$.

Prove: (a) There are infinitely many triples of positive integers $m, n, p$ such that $4mn - m- n = p^2 - 1.$ (b) There are no positive integers $m, n, p$ such that $4mn - m- n = p^2.$

Solve in $ \mathbb{Z}^2 $ the equation: $ x^2\left( 1+x^2 \right) =-1+21^y. $ [i]Lucian Petrescu[/i]

In a right circular cone of wood, the radius of the circumference $T$ of the base circle measures $10$ cm, while every point on said circumference is $20$ cm away. from the apex of the cone. A red ant and a termite are located at antipodal points of $T$. A black ant is located at the midpoint of the segment that joins the vertex with the position of the termite. If the red ant moves to the black ant's position by the shortest possible path, how far does it travel?

Let $\Omega$ be a set of $n$ points, where $n>2$. Let $\Sigma$ be a nonempty subcollection of the $2^n$ subsets of $\Omega$ that is closed with respect to the unions, intersections and complements. If $k$ is the number of elements of $\Sigma,$ what are the possible values of $k?$

In a year that has $53$ Saturdays, what day of the week is May $12$? Give all chances.

Jackson begins at $1$ on the number line. At each step, he remains in place with probability $85\%$ and increases his position on the number line by $1$ with probability $15\%$. Let $d_n$ be his position on the number line after $n$ steps, and let $E_n$ be the expected value of $\tfrac{1}{d_n}$. Find the least $n$ such that $\tfrac{1}{E_n} > 2017$.

In a parallelogram $ABCD$, let $M$ be the point on the $BC$ side such that $MC = 2BM$ and let $N$ be the point of side $CD$ such that $NC = 2DN$. If the distance from point $B$ to the line $AM$ is $3$, calculate the distance from point $N$ to the line $AM$.

A $(0_x, 1_y, 2_z)$-string is an infinite ternary string such that: [list] [*] If there is a $0$ in position $i$ then there is a $1$ in position $i + x$, [*] if there is a $1$ in position $j$ then there is a $2$ in position $j + y$, [*] if there is a $2$ in position $k$ then there is a $0$ in position $k + z$. [/list] For how many ordered triples of positive integers $(x, y, z)$ with $x, y, z \leq 100$ does there exist $(0_x, 1_y, 2_z)$-string?

How many real roots do $x^5 +3x^4 -4x^3 -8x^2 +6x-1$ and $x^5-3x^4 -2x^3 -3x^2 -6x+1$ share?

A triangle of sides $\frac{3}{2}, \frac{\sqrt{5}}{2}, \sqrt{2}$ is folded along a variable line perpendicular to the side of $\frac{3}{2}.$ Find the maximum value of the coincident area.

In a village, there are $n$ houses with $n>2$ and all of them are not collinear. We want to generate a water resource in the village. For doing this, point $A$ is [i]better[/i] than point $B$ if the sum of the distances from point $A$ to the houses is less than the sum of the distances from point $B$ to the houses. We call a point [i]ideal[/i] if there doesn’t exist any [i]better[/i] point than it. Prove that there exist at most $1$ [i]ideal[/i] point to generate the resource.

Prove that if the natural numbers $ a $ and $ b $ satisfy the equation $ a^2+a = 3b^2 $, then the number $ a+1 $ is the square of an integer.

Find a sequence of maximal length consisting of non-zero integers in which the sum of any seven consecutive terms is positive and that of any eleven consecutive terms is negative.

Given right triangle $ABC$ with right angle at $C$, construct three external squares $ABDE$, $BCFG$, and $ACHI$. If $DG = 19$ and $EI = 22$, compute the length of $FH$.

Quadrilateral $APBQ$ is inscribed in circle $\omega$ with $\angle P = \angle Q = 90^{\circ}$ and $AP = AQ < BP$. Let $X$ be a variable point on segment $\overline{PQ}$. Line $AX$ meets $\omega$ again at $S$ (other than $A$). Point $T$ lies on arc $AQB$ of $\omega$ such that $\overline{XT}$ is perpendicular to $\overline{AX}$. Let $M$ denote the midpoint of chord $\overline{ST}$. As $X$ varies on segment $\overline{PQ}$, show that $M$ moves along a circle.

Let $p \geq 2$ be a natural number. Prove that there exist an integer $n_0$ such that \[ \sum^{n_0}_{i=1} \frac{1}{i \cdot \sqrt[p]{i + 1}} > p. \]

There is a heads up coin on every integer of the number line. Lucky is initially standing on the zero point of the number line facing in the positive direction. Lucky performs the following procedure: $\bullet$ Lucky looks at the coin (or lack thereof) underneath him. $\bullet \, - \, $ If the coin is heads, Lucky flips it to tails up, turns around, and steps forward a distance of one unit. $ \qquad a -$ If the coin is tails, Lucky picks up the coin and steps forward a distance of one unit facing the same direction. $ \qquad a -$ If there is no coin, Lucky places a coin heads up underneath him and steps forward a distance of one unit facing the same direction. He repeats this procedure until there are 20 coins anywhere that are tails up. How many times has Lucky performed the procedure when the process stops?

Let $m$ and $n$ be any two odd numbers, with $n$ less than $m$. The largest integer which divides all possible numbers of the form $m^2-n^2$ is: $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 16 $

If $y=a+\frac{b}{x}$, where $a$ and $b$ are constants, and if $y=1$ when $x=-1$, and $y=5$ when $x=-5$, then $a+b$ equals: $ \textbf{(A)}\ -1 \qquad\textbf{(B)}\ 0\qquad\textbf{(C)}\ 1\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11 $

Given seven points on a plane, with no three points collinear. Prove that it is always possible to divide these points into the vertices of a triangle and a convex quadrilateral, with no shared parts between the two shapes.

Arthur is driving to David’s house intending to arrive at a certain time. If he drives at 60 km/h, he will arrive 5 minutes late. If he drives at 90 km/h, he will arrive 5 minutes early. If he drives at n  km/h, he will arrive exactly on time. What is the value of n?