Let $n$ be a positive integer. Prove that there exists a finite sequence $S$ consisting of only zeros and ones, satisfying the following property: for any positive integer $d \geq 2$, when $S$ is interpreted in base $d$, the resulting number is non-zero and divisible by $n$. Remark: The sequence $S=s_ks_{k-1} \cdots s_1s_0$ interpreted in base $d$ is the number $\sum_{i=0}^{k}s_id^i$

Let $ABCD$ be a convex quadrilateral such that the circle with diameter $AB$ is tangent to the line $CD$, and the circle with diameter $CD$ is tangent to the line $AB$. Prove that the two intersection points of these circles and the point $AC \cap BD$ are collinear.

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either: the rabbit cannot move; or the hunter can determine the cell in which the rabbit started. Decide whether there exists a winning strategy for the hunter. Proposed by Aron Thomas

Given a (simple) graph $G$ with $n \geq 2$ vertices $v_1, v_2, \dots, v_n$ and $m \geq 1$ edges, Joël and Robert play the following game with $m$ coins: Joël first assigns to each vertex $v_i$ a non-negative integer $w_i$ such that $w_1+\cdots+w_n=m$. Robert then chooses a (possibly empty) subset of edges, and for each edge chosen he places a coin on exactly one of its two endpoints, and then removes that edge from the graph. When he is done, the amount of coins on each vertex $v_i$ should not be greater than $w_i$. Joël then does the same for all the remaining edges. Joël wins if the number of coins on each vertex $v_i$ is equal to $w_i$. Determine all graphs $G$ for which Joël has a winning strategy.

Let $a, b, c, \lambda$ be positive real numbers with $\lambda \geq 1/4$. Show that $$\frac{a}{\sqrt{b^2+\lambda bc+c^2}}+\frac{b}{\sqrt{c^2+\lambda ca+a^2}}+\frac{c}{\sqrt{a^2+\lambda ab+b^2}} \geq \frac{3}{\sqrt{\lambda +2}}.$$

Let $n \geq 2$ be an integer. Prove that if $$\frac{n^2+4^n+7^n}{n}$$is an integer, then it is divisible by 11.

Let $n$ be a positive integer. Find all polynomials $P$ with real coefficients such that $$P(x^2+x-n^2)=P(x)^2+P(x)$$for all real numbers $x$.

Johann and Nicole are playing a game on the coordinate plane. First, Johann draws any polygon $\mathcal{S}$ and then Nicole can shift $\mathcal{S}$ to wherever she wants. Johann wins if there exists a point with coordinates $(x, y)$ in the interior of $\mathcal{S}$, where $x$ and $y$ are coprime integers. Otherwise, Nicole wins. Determine who has a winning strategy.

Let $ABCD$ be a quadrilateral inscribed in a circle $\Omega.$ Let the tangent to $\Omega$ at $D$ meet rays $BA$ and $BC$ at $E$ and $F,$ respectively. A point $T$ is chosen inside $\triangle ABC$ so that $\overline{TE}\parallel\overline{CD}$ and $\overline{TF}\parallel\overline{AD}.$ Let $K\ne D$ be a point on segment $DF$ satisfying $TD=TK.$ Prove that lines $AC,DT,$ and $BK$ are concurrent.

Let $ABCD$ be a parallelogram with $AC=BC.$ A point $P$ is chosen on the extension of ray $AB$ past $B.$ The circumcircle of $ACD$ meets the segment $PD$ again at $Q.$ The circumcircle of triangle $APQ$ meets the segment $PC$ at $R.$ Prove that lines $CD,AQ,BR$ are concurrent.

Let $\mathbb{R}^+$ denote the set of positive real numbers. Find all functions $f:\mathbb{R}^+ \to \mathbb{R}^+$ such that \[x+f(yf(x)+1)=xf(x+y)+yf(yf(x))\]for all $x,y>0.$