A function $f$ is defined for all real numbers and satisfies \[f(2 + x) = f(2 - x)\qquad\text{and}\qquad f(7 + x) = f(7 - x)\] for all real $x$. If $x = 0$ is a root of $f(x) = 0$, what is the least number of roots $f(x) = 0$ must have in the interval $-1000 \le x \le 1000$?

A cardboard box in the shape of a rectangular parallelopiped is to be enclosed in a cylindrical container with a hemispherical lid. If the total height of the container from the base to the top of the lid is $60$ centimetres and its base has radius $30$ centimetres, find the volume of the largest box that can be completely enclosed inside the container with the lid on.

Six distinct integers are picked at random from $\{1,2,3,\ldots,10\}$. What is the probability that, among those selected, the second smallest is $3$? $ \textbf{(A)}\ \frac{1}{60}\qquad\textbf{(B)}\ \frac{1}{6}\qquad\textbf{(C)}\ \frac{1}{3}\qquad\textbf{(D)}\ \frac{1}{2}\qquad\textbf{(E)}\ \text{none of these} $

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time. (i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it. (ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment. Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.

Find all positive integers $k$ such that $k^k +1$ is divisible by $30$. Justify your answer.

Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.

Prove that there are infinitely many positive integers $ n$ for which all the prime divisors of $ n^{2}\plus{}n\plus{}1$ are not more then $ \sqrt{n}$. [hide] Stronger one. Prove that there are infinitely many positive integers $ n$ for which all the prime divisors of $ n^{3}\minus{}1$ are not more then $ \sqrt{n}$.[/hide]

Write down $f(n)$ for the greatest odd divisor of $n \in N_0$. (a) Determine $f (n + 1) + f (n + 2) + ... + f(2n)$. (b) Determine $f(1) + f(2) + f(3) + ... + f(2n)$.

Compute the value of \[\int_{-\pi}^\pi\frac{e^{x^2}-e^{-x^2}}{e^{x^2}-x\sqrt{2}}|x|dx.\]

Let $ x_n = (p + \sqrt{q})^n - [(p + \sqrt{q})^n] $ for $ n = 1, 2, 3, \ldots $. Prove that if $ p $, $ q $ are natural numbers satisfying the condition $ p - 1 < \sqrt{q} < p $, then $ \lim_{n\to \infty} x_n = 1 $. Attention. The symbol $ [a] $ denotes the largest integer not greater than $ a $.

Fuzzy draws a segment of positive length in a plane. How many locations can Fuzzy place another point in the same plane to form a non-degenerate isosceles right triangle with vertices consisting of his new point and the endpoints of the segment? [i]Proposed by Timothy Qian[/i]

Find all positive integers $n,k_1,\dots,k_n$ such that $k_1+\cdots+k_n=5n-4$ and \[ \frac1{k_1}+\cdots+\frac1{k_n}=1. \]

In the triangle $ABC$ we have $\angle A = 2\angle C$ and $2\angle B = \angle A + \angle C$. The angle bisector of $\angle C$ intersects the segment $AB$ in $E$, let $F$ be the midpoint of $AE$, let $AD$ be the altitude of the triangle $ABC$. The perpendicular bisector of $DF$ intersects $AC$ in $M$. Prove that $AM = CM$.

In the parallelogram $ABCD$, the length of side $AB$ is half the length of side $BC$. The bisector of angle $\angle ABC$ intersects side $AD$ at point $K$ and diagonal $AC$ at point $L$. The bisector of angle $\angle ADC$ intersects the extension of side $AB$ at point $M$, with $B$ between $A$ and $M$. The line $ML$ intersects side $AD$ at point $F$. Calculate the ratio $\frac{AF}{AD}$.

Let $f:[0, \infty) \to \mathbb{R}$ a continuous function, constant on $\mathbb{Z}_{\geq 0}.$ For any $0 \leq a < b < c < d$ which satisfy $f(a)=f(c)$ and $f(b)=f(d)$ we also have $f \left( \frac{a+b}{2} \right) = f \left( \frac{c+d}{2} \right).$ Prove that $f$ is constant.

The infinite decimal notation of the real number $x$ contains all the digits. Let $u_n$ be the number of different $n$-digit segments encountered in $x$ notation. Prove that if for some $n$, $u_n \le (n+8)$, than $x$ is a rational number.

Consider $16$ points arranged as shown, with horizontal and vertical distances of $1$ between consecutive rows and columns. In how many ways can one choose four of these points such that the distance between every two of those four points is strictly greater than $2$? [asy] for (int x = 0; x < 4; ++x) { for (int y = 0; y < 4; ++y) { dot((x, y)); } } [/asy]

Prove that for all positive integers $n$ there exist $n$ distinct, positive rational numbers with sum of their squares equal to $n$. Proposed by Daniyar Aubekerov

The trapezoid $ABCD$, of bases $AB$ and $CD$, is inscribed in a circumference $\Gamma$. Let $X$ a variable point of the arc $AB$ of $\Gamma$ that does not contain $C$ or $D$. We denote $Y$ to the point of intersection of $AB$ and $DX$, and let Z be the point of the segment $CX$ such that $\frac{XZ}{XC}=\frac{AY}{AB}$ . Prove that the measure of $\angle AZX$ does not depend on the choice of $X.$

Let $ABC$ be an equilateral triangle with side length $1$. Say that a point $X$ on side $\overline{BC}$ is [i]balanced[/i] if there exists a point $Y$ on side $\overline{AC}$ and a point $Z$ on side $\overline{AB}$ such that the triangle $XYZ$ is a right isosceles triangle with $XY = XZ$. Find with proof the length of the set of all balanced points on side $\overline{BC}$.

Find all pairs $(m, n)$ of positive integers such that $m^2 + 2n^2 = 3(m + 2n)$

There are $n$ cities, $2$ airline companies in a country. Between any two cities, there is exactly one $2$-way flight connecting them which is operated by one of the two companies. A female mathematician plans a travel route, so that it starts and ends at the same city, passes through at least two other cities, and each city in the route is visited once. She finds out that wherever she starts and whatever route she chooses, she must take flights of both companies. Find the maximum value of $n$.

One bisector of a given triangle is parallel to one sideline of its Nagel triangle. Prove that one of two remaining bisectors is parallel to another sideline of the Nagel triangle. Proposed by:L.Emelyanov

Let $a_1 \leq a_2 \leq \cdots$ be a non-decreasing sequence of positive integers. A positive integer $n$ is called [i]good[/i] if there is an index $i$ such that $n=\dfrac{i}{a_i}$. Prove that if $2013$ is [i]good[/i], then so is $20$.

$\textbf{Juan's Old Stamping Grounds}$ Juan organizes the stamps in his collection by country and by the decade in which they were issued. The prices he paid for them at a stamp shop were: Brazil and France, 6 cents each, Peru 4 cents each, and Spain 5 cents each. (Brazil and Peru are South American countries and France and Spain are in Europe.) [asy] /* AMC8 2002 #8, 9, 10 Problem */ size(3inch, 1.5inch); for ( int y = 0; y <= 5; ++y ) { draw((0,y)--(18,y)); } draw((0,0)--(0,5)); draw((6,0)--(6,5)); draw((9,0)--(9,5)); draw((12,0)--(12,5)); draw((15,0)--(15,5)); draw((18,0)--(18,5)); draw(scale(0.8)*"50s", (7.5,4.5)); draw(scale(0.8)*"4", (7.5,3.5)); draw(scale(0.8)*"8", (7.5,2.5)); draw(scale(0.8)*"6", (7.5,1.5)); draw(scale(0.8)*"3", (7.5,0.5)); draw(scale(0.8)*"60s", (10.5,4.5)); draw(scale(0.8)*"7", (10.5,3.5)); draw(scale(0.8)*"4", (10.5,2.5)); draw(scale(0.8)*"4", (10.5,1.5)); draw(scale(0.8)*"9", (10.5,0.5)); draw(scale(0.8)*"70s", (13.5,4.5)); draw(scale(0.8)*"12", (13.5,3.5)); draw(scale(0.8)*"12", (13.5,2.5)); draw(scale(0.8)*"6", (13.5,1.5)); draw(scale(0.8)*"13", (13.5,0.5)); draw(scale(0.8)*"80s", (16.5,4.5)); draw(scale(0.8)*"8", (16.5,3.5)); draw(scale(0.8)*"15", (16.5,2.5)); draw(scale(0.8)*"10", (16.5,1.5)); draw(scale(0.8)*"9", (16.5,0.5)); label(scale(0.8)*"Country", (3,4.5)); label(scale(0.8)*"Brazil", (3,3.5)); label(scale(0.8)*"France", (3,2.5)); label(scale(0.8)*"Peru", (3,1.5)); label(scale(0.8)*"Spain", (3,0.5)); label(scale(0.9)*"Juan's Stamp Collection", (9,0), S); label(scale(0.9)*"Number of Stamps by Decade", (9,5), N); [/asy] The average price of his '70s stamps is closest to $\text{(A)}\ 3.5 \text{ cents} \qquad \text{(B)}\ 4 \text{ cents} \qquad \text{(C)}\ 4.5 \text{ cents} \qquad \text{(D)}\ 5 \text{ cents} \qquad \text{(E)}\ 5.5 \text{ cents}$