A polynomial $P(x)$ has unity as the coefficient of its highest power, and has the property that with natural number arguments, it can take all values of form $2^M$ , where $M$ is a natural number. Prove that the polynomial is of degree $1$.

[u]Round 6[/u] [b]p16.[/b] Let $ABC$ be a triangle with $AB = 3$, $BC = 4$, and $CA = 5$. There exist two possible points $X$ on $CA$ such that if $Y$ and $Z$ are the feet of the perpendiculars from $X$ to $AB$ and $BC,$ respectively, then the area of triangle $XY Z$ is $1$. If the distance between those two possible points can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, and $c$ with $b$ squarefree and $gcd(a, c) = 1$, then find $a +b+ c$. [b]p17.[/b] Let $f(n)$ be the number of orderings of $1,2, ... ,n$ such that each number is as most twice the number preceding it. Find the number of integers $k$ between $1$ and $50$, inclusive, such that $f (k)$ is a perfect square. [b]p18.[/b] Suppose that $f$ is a function on the positive integers such that $f(p) = p$ for any prime p, and that $f (xy) = f(x) + f(y)$ for any positive integers $x$ and $y$. Define $g(n) = \sum_{k|n} f (k)$; that is, $g(n)$ is the sum of all $f(k)$ such that $k$ is a factor of $n$. For example, $g(6) = f(1) + 1(2) + f(3) + f(6)$. Find the sum of all composite $n$ between $50$ and $100$, inclusive, such that $g(n) = n$. [u]Round 7[/u] [b]p19.[/b] AJ is standing in the center of an equilateral triangle with vertices labelled $A$, $B$, and $C$. They begin by moving to one of the vertices and recording its label; afterwards, each minute, they move to a different vertex and record its label. Suppose that they record $21$ labels in total, including the initial one. Find the number of distinct possible ordered triples $(a, b, c)$, where a is the number of $A$'s they recorded, b is the number of $B$'s they recorded, and c is the number of $C$'s they recorded. [b]p20.[/b] Let $S = \sum_{n=1}^{\infty} (1- \{(2 + \sqrt3)^n\})$, where $\{x\} = x - \lfloor x\rfloor$ , the fractional part of $x$. If $S =\frac{\sqrt{a} -b}{c}$ for positive integers $a, b, c$ with $a $ squarefree, find $a + b + c$. [b]p21.[/b] Misaka likes coloring. For each square of a $1\times 8$ grid, she flips a fair coin and colors in the square if it lands on heads. Afterwards, Misaka places as many $1 \times 2$ dominos on the grid as possible such that both parts of each domino lie on uncolored squares and no dominos overlap. Given that the expected number of dominos that she places can be written as $\frac{a}{b}$, for positive integers $a$ and $b$ with $gcd(a, b) = 1$, find $a + b$. PS. You should use hide for answers. Rounds 1-3 have been posted [url=https://artofproblemsolving.com/community/c4h3131401p28368159]here [/url] and 4-5 [url=https://artofproblemsolving.com/community/c4h3131422p28368457]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $S$ the set of natural numbers from $1$ up to $1001$ , $S=\{1,2,...,1001\}$. Lisandro thinks of a number $N$ of $S$ , and Carla has to find out that number with the following procedure. She gives Lisandro a list of subsets of $S$, Lisandro reads it and tells Carla how many subsets of her list contain $N$ . If Carla wishes, she can repeat the same thing with a second list, and then with a third, but no more than $3$ are allowed. What is the smallest total number of subsets that allow Carla to find $N$ for sure?

In the complex plane, consider squares having the following property: the complex numbers its vertex correspond to are exactly the roots of integer coefficients equation $ x^4 \plus{} px^3 \plus{} qx^2 \plus{} rx \plus{} s \equal{} 0$. Find the minimum of square areas.

The number of ounces of water needed to reduce $ 9$ ounces of shaving lotion containing $ 50\%$ alcohol to a lotion containing $ 30\%$ alcohol is: $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 6 \qquad\textbf{(E)}\ 7$

Let be given three quadratic polynomials: $P_1(x) = x^2 + p_1x+q_1, P_2(x) = x^2+ p_2x+q_2, P_3(x) = x^2 + p_3x+q_3$. Prove that the equation $|P_1(x)|+|P_2(x)| = |P_3(x)|$ has at most eight real roots.

The quadrilateral $ABCD$ is inscribed in a circle with center $O$. The diagonals $AC$ and $BD$ do not pass through $O$. If the circumcentre of triangle $AOC$ lies on the line $BD$, prove that the circumcentre of triangle $BOD$ lies on the line $AC$.

Let $ABCD$ be a convex trapezoid such that $\angle{DAB}=\angle{ABC}=90^{\circ},DA=2,AB=3,$ and $BC=8$. Let $\omega$ be a circle passing through $A$ and tangent to segment $CD$ at point $T$. Suppose that the center of $\omega$ lies on line $BC$. Compute $CT$.

What is the maximum possible score on this contest? Recall that on the NIMO 2013 Summer Contest, problems $1$, $2$, \dots, $15$ are worth $1$, $2$, \dots, $15$ points, respectively. [i]Proposed by Evan Chen[/i]

The circle inscribed in the triangle $ ABC $ , with center $O$, touches the sides $ AB $ and $ BC $ at the points $ C_1 $ and $ A_1 $, respectively. The lines $ CO $ and $ AO $ intersect the line $ C_1A_1 $ at the points $ K $ and $ L $. $ M $ is the midpoint of $ AC $ and $ \angle ABC = 60^\circ $. Prove that $ KLM $ is a regular triangle.

Let $ABC$ be a triangle with $\angle A = 60^\circ$, and $AA', BB', CC'$ be its internal angle bisectors. Prove that $\angle B'A'C' \le 60^\circ$.

Michael is trying to drive a bus from his home, $(0,0)$, to school, located at $(6,6)$. There are horizontal and vertical roads at every line $x=0,1,\ldots,6$ and $y=0,1,\ldots,6$. The city has placed $6$ roadblocks on lattice point intersections $(x,y)$ with $0\leq x,y \leq 6$. Michael notices that the only path he can take that only goes up and to the right is directly up from $(0,0)$ to $(0,6)$, and then right to $(6,6)$. How many sets of $6$ locations could the city have blocked?

Prove that, we find infinite numbers such that, this number writeable $1999k+1$ for $k \in {\mathbb N}$ and all digits are equal.

Richard and Kaarel are taking turns to choose numbers from the set $\{1,\dots,p-1\}$ where $p > 3$ is a prime. Richard is the first one to choose. A number which has been chosen by one of the players cannot be chosen again by either of the players. Every number chosen by Richard is multiplied with the next number chosen by Kaarel. Kaarel wins the game if at any moment after his turn the sum of all of the products calculated so far is divisible by $p$. Richard wins if this does not happen, i.e. the players run out of numbers before any of the sums is divisible by $p$. Can either of the players guarantee their victory regardless of their opponent's moves and if so, which one?

Prove that if the product of four consecutive natural numbers is added one unit, the result is a perfect square.

A rich knight has a chest and a lot of coins, so every day he puts into the chest some quantity of coins - among the numbers $1, 2, \ldots, 100$. If there exist two days on which he added equal quantities of coins (say, $k$ coins) and he has added in total at most $100k$ coins on the days between these two days, he stops putting coins into the chest. Prove that this will necessarily happen eventually.

Suppose that for some positive integer $n$, the first two digits of $5^n$ and $2^n$ are identical. Suppose the first two digits are $a$ and $b$ in this order. Find the two-digit number $\overline{ab}$.

Let $n$ be a positive integer and $x_1,x_2,\ldots,x_n$ be positive reals. Show that there are numbers $a_1,a_2,\ldots, a_n \in \{-1,1\}$ such that the following holds: \[a_1x_1^2+a_2x_2^2+\cdots+a_nx_n^2 \ge (a_1x_1+a_2x_2 +\cdots+a_nx_n)^2\]

Brent has goldfish that quadruple (become four times as many) every month, and Gretel has goldfish that double every month. If Brent has $4$ goldfish at the same time that Gretel has $128$ goldfish, then in how many months from that time will they have the same number of goldfish? $\text{(A)}\ 4 \qquad \text{(B)}\ 5 \qquad \text{(C)}\ 6 \qquad \text{(D)}\ 7 \qquad \text{(E)}\ 8$

An ant crawled a total distance of $1$ in the plane and returned to its original position (so that its path is a closed loop of length $1$; the width is considered to be $0$). Prove that there is a circle of radius $\frac{1}{4}$ containing the path. Illustration of an example path:

The lettes $A,C,F,H,L$ and $S$ represent six not necessarily distinct decimal digits so that $S \ne 0$ and $F \ne 0$. We form the two six-digit numbers $SCHLAF$ and $FLACHS$. Show that the difference of these two numbers is divisible by $271$ if and only if $C=L$ and $H=A$. [i]Remark:[/i] The words "Schlaf" and "Flachs" are German for "sleep" and "flax".

Prove that there are infinitely many positive integers $n$ with the following property: For any $n$ integers $a_{1},a_{2},...,a_{n}$ which form in arithmetic progression, both the mean and the standard deviation of the set $\{a_{1},a_{2},...,a_{n}\}$ are integers. [i]Remark[/i]. The mean and standard deviation of the set $\{x_{1},x_{2},...,x_{n}\}$ are defined by $\overline{x}=\frac{x_{1}+x_{2}+...+x_{n}}{n}$ and $\sqrt{\frac{\sum (x_{i}-\overline{x})^{2}}{n}}$, respectively.

Let $a$,$b$ and $c$ be sides of a triangle such that $a+b+c\le2$. Prove that $-3<{\frac{a^3}{b}+\frac{b^3}{c}+\frac{c^3}{a}-\frac{a^3}{c}-\frac{b^3}{a}-\frac{c^3}{b}}<3$

Consider a regular pentagon $ABCDE$, and let the intersection of diagonals $\overline{CA}$ and $\overline{EB}$ be $F$. Find $\angle AFB$. [i]Proposed by Justin Chen[/i]

Mike cycled $15$ laps in $57$ minutes. Assume he cycled at a constant speed throughout. Approximately how many laps did he complete in the first $27$ minutes? $\textbf{(A) } 5 \qquad \textbf{(B) } 7 \qquad \textbf{(C) } 9 \qquad \textbf{(D) } 11 \qquad \textbf{(E) } 13$