The symbol $N_m$ denotes the set of all integers not less than the given integer $m$. Find all functions $f: N_m \to N_m$ such that $f(x^2+f(y))=y^2+f(x)$ for all $x,y \in N_m$.

At least how many numbers must be deleted from the product $1 \times 2 \times \dots \times 46 \times 47$ in order to make it a perfect square?

In a triangle $ABC$ ($\angle{BCA} = 90^{\circ}$), let $D$ be the intersection of $AB$ with a circumference with diameter $BC$. Let $F$ be the intersection of $AC$ with a line tangent to the circumference. If $\angle{CAB} = 46^{\circ}$, find the measure of $\angle{CFD}$.

The closure (interior and boundary) of a convex quadrangle is covered by four closed discs centered at each vertex of the quadrangle each. Show that three of these discs cover the closure of the triangle determined by their centers.

Zscoder has an simple undirected graph $G$ with $n\ge 3$ vertices. Navi labels a positive integer to each vertex, and places a token at one of the vertex. This vertex is now marked red. In each turn, Zscoder plays with following rule: $\bullet$ If the token is currently at vertex $v$ with label $t$, then he can move the token along the edges in $G$ (possibly repeating some edges) exactly $t$ times. After these $t$ moves, he marks the current vertex red where the token is at if it is unmarked, or does nothing otherwise, then finishes the turn. Zscoder claims that he can mark all vertices in $G$ red after finite number of turns, regardless of Navi's labels and starting vertex. What is the minimum number of edges must $G$ have, in terms of $n$? [i]Proposed by Yeoh Zi Song[/i]

Pablo and Nacho write together a succession of positive integers of $2006$ terms, according to the following rules: Pablo begins, who in his first turn writes $1$, and from then on, each one in his turn writes an integer positive that is greater than or equal to the last number that the opponent wrote and less than or equal to triple the last number that the opponent wrote. When the two of them have written the $2006$ numbers, the sum $S$ of the first $ 2005$ numbers written (all except the last one) and the sum $T$ of the $2006$ numbers written. If $S$ and $T $ are co-cousins, Nacho wins. Otherwise, Pablo wins. Determine which of the two players has a winning strategy, describe the strategy and demonstrate that it is a winning one.

Determine all integers $s \ge 4$ for which there exist positive integers $a$, $b$, $c$, $d$ such that $s = a+b+c+d$ and $s$ divides $abc+abd+acd+bcd$. [i]Proposed by Ankan Bhattacharya and Michael Ren[/i]

On the circle $\gamma$ the points $A$ and $B$ are selected. The circle $\omega$ touches the segment $AB$ at the point $K$ and intersects the circle $\gamma$ at the points $M$ and $N$. The points lie on the circle $\gamma$ in the following order: $A, \, \, M, \, \, N, \, \, B$. Prove that $\angle AMK = \angle KNB$. (Yuri Biletsky)

Let $f(x) = 2x^2 + x - 1, f^{0}(x) = x$, and $f^{n+1}(x) = f(f^{n}(x))$ for all real $x>0$ and $n \ge 0$ integer (that is, $f^{n}$ is $f$ iterated $n$ times). a) Find the number of distinct real roots of the equation $f^{3}(x) = x$ b) Find, for each $n \ge 0$ integer, the number of distinct real solutions of the equation $f^{n}(x) = 0$

The $n$ participants of a tournament are numbered with $0$ through $n - 1$. At the end of the tournament it turned out that for every team, numbered with $s$ and having $t$ points, there are exactly $t$ teams having $s$ points each. Determine all possibilities for the final score list.

A school needs to elect its president. The school has $121$ students, each of whom belongs to one of two tribes: Geometers or Algebraists. Two candidates are running for president: one Geometer and one Algebraist. The Geometers vote only for Geometers and the Algebraists only for Algebraists. There are more Algebraists than Geometers, but the Geometers are resourceful. They convince the school that the following two-step procedure is fairer: [list=a] [*]The school is divided into $11$ groups, with $11$ students in each group. Each group elects a representative for step 2. [*]The $11$ elected representatives elect a president. [/list] Not only do the Geometers manage to have this two-step procedure approved, they also volunteer to assign the students to groups for step 1. What is the minimum number of Geometers in the school that guarantees they can elect a Geometer as president? (In any stage of voting, the majority wins.)

Two circles $\Gamma_1$ and $\Gamma_2$ meet at $A$ and $B$. A line through $B$ meets $\Gamma_1$ and $\Gamma_2$ again at $C$ and $D$ repsectively. Another line through $B$ meets $\Gamma_1$ and $\Gamma_2$ again at $E$ and $F$ repsectively. Line $CF$ meets $\Gamma_1$ and $\Gamma_2$ again at $P$ and $Q$ respectively. $M$ and $N$ are midpoints of arc $PB$ and arc $QB$ repsectively. Show that if $CD = EF$, then $C,F,M,N$ are concyclic.

Let $r$ and $s$ be real numbers in the interval $[1, \infty)$ such that for all positive integers $a$ and $b$ with $a \mid b \implies \left\lfloor ar \right\rfloor$ divides $\left\lfloor bs \right\rfloor$. a) Prove that $\frac{s}{r}$ is a natural number. b) Show that both $r$ and $s$ are natural numbers. Here, $\lfloor x \rfloor$ denotes the greatest integer that is less than or equal to $x$.

A floor is tiled with equilateral triangles of side length $1$, as shown. If you drop a needle of length $2$ somewhere on the floor , what is the largest number of triangles it could end up intersecting? (Only count the triangles whose interiors are met by the needle --- touching along edges or at corners doesn't qualify.) [img]https://cdn.artofproblemsolving.com/attachments/5/6/e7555c22ffe890b46a3ebdbda2169d23e43700.png[/img]

Let $n$ be natural number. Each of the numbers $\in\{1,2,\ldots ,n\}$ is coloured in black or white. When we choose a number, we flip it's colour and the colour of all the numbers which have at least one common divider with the chosen number. At the beginning all the numbers were coloured white. For which $n$ are all the numbers black after a finite number of changes?

Prove that for each natural number $k$ there exists a natural number $n(k)$, such that for each $m\geq n(k)$ and each set $M$ of $m$ points in the plane, there can be chosen $k$ triangles, so that each has an angle greater than $120^\circ$.

The roots of the polynomial $10x^3 - 39x^2 + 29x - 6$ are the height, length, and width of a rectangular box (right rectangular prism. A new rectangular box is formed by lengthening each edge of the original box by 2 units. What is the volume of the new box? $\textbf{(A) }\frac{24}{5}\qquad\textbf{(B) }\frac{42}{5}\qquad\textbf{(C) }\frac{81}{5}\qquad\textbf{(D) }30\qquad\textbf{(E) }48$