Let $A$ be a point and let k be a circle through $A$. Let $B$ and $C$ be two more points on $k$. Let $X$ be the intersection of the bisector of $\angle ABC$ with $k$. Let $Y$ be the reflection of $A$ wrt point $X$, and $D$ the intersection of the straight line $YC$ with $k$. Prove that point $D$ is independent of the choice of $B$ and $C$ on the circle $k$.

Let $\mathbb{P}$ be the set of all primes and let $M$ be a subset of $\mathbb{P}$ with at least three elements. Suppose that for all $k \geq 1$ and for all subsets $A=\{p_1,p_2,\dots ,p_k \}$ of $M$ ,$A\neq M$ , all prime factors of $p_1p_2\dots p_k-1$ are in $M$ . Prove that $M=\mathbb{P}$.

Find all periodic sequences $x_1,x_2,\dots$ of strictly positive real numbers such that $\forall n \geq 1$ we have $$x_{n+2}=\frac{1}{2} \left( \frac{1}{x_{n+1}}+x_n \right)$$

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \]turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

A group of children is sitting around a round table . At first, each child has an even number of candies. Each turn, each child gives half of his candies to the child sitting at his right. If, after a turn, a child has an odd number of candies, the teacher gives him\her an extra candy. Show that after a finite number of rounds all children will have the same number of candies.

Show that there exists no function $f : Z \to Z$ such that for all $m, n \in Z$ $$f(m + f(n)) = f(m) - n.$$

Let $ABC$ be a triangle with $\angle CAB = 2 \angle ABC$. Assume that a point $D$ is inside the triangle $ABC$ exists such that $AD = BD$ and $CD = AC$. Show that $\angle ACB = 3 \angle DCB$.

An integer $n\ge2$ is called resistant, if it is coprime to the sum of all its divisors (including $1$ and $n$). Determine the maximum number of consecutive resistant numbers. For instance: * $n=5$ has sum of divisors $S=6$ and hence is resistant. * $n=6$ has sum of divisors $S=12$ and hence is not resistant. * $n=8$ has sum of divisors $S=15$ and hence is resistant. * $n=18$ has sum of divisors $S=39$ and hence is not resistant.