Determine all real numbers $\alpha$ such that, for every positive integer $n,$ the integer $$\lfloor\alpha\rfloor +\lfloor 2\alpha\rfloor +\cdots +\lfloor n\alpha\rfloor$$ is a multiple of $n.$ (Note that $\lfloor z\rfloor$ denotes the greatest integer less than or equal to $z.$ For example, $\lfloor -\pi\rfloor =-4$ and $\lfloor 2\rfloor= \lfloor 2.9\rfloor =2.$) [i]Proposed by Santiago Rodríguez, Colombia[/i]

Let $E$ and $F$ be points on the side $AB$ of a rectangle $ABCD$ such that $AE = EF$. The line through $E$ perpendicular to $AB$ intersects the diagonal $AC$ at $G$, and the segments $FD$ and $BG$ intersect at $H$. Prove that the areas of the triangles $FBH$ and $GHD$ are equal.

Prove that among $18$ consecutive three digit numbers there must be at least one which is divisible by the sum of its digits.

There are three sticks, each of which has an integer length which is at least $n$; the sum of their lengths is $n(n + 1)/2$. Prove that it is possible to break the sticks (possibly several times) so that the resulting sticks have length $1, 2,\dots, n$. [i]Note: a stick of length $a + b$ can be broken into sticks of lengths $a$ and $b$.[/i]

Find all polynomials $P(x)$ with real coefficients having the following property: There exists a positive integer n such that the equality $$\sum_{k=1}^{2n+1}(-1)^k \left[\frac{k}{2}\right] P(x + k)=0$$ holds for infinitely many real numbers $x$.

$100$ numbers $1$, $1/2$, $1/3$, $...$, $1/100$ are written on the blackboard. One may delete two arbitrary numbers $a$ and $b$ among them and replace them by the number $a + b + ab$. After $99$ such operations only one number is left. What is this final number? (D. Fomin, Leningrad)

Given an acute-angled triangle $ABC$. Let $CB$ be the altitude and $E$ a random point on the line $CD$. Finally, let $P, Q, R$ and $S$ are the projections of $D$ on the straight lines $AC, AE, BE$ and $BC$. Prove that the points $P, Q, R$ and $S$ lie either on a circle or on one straight line.

Let $A_1 A_2…A_{66}$ be a convex 66-gon. What’s the greatest number of pentagons $A_i A_{i+1} A_{i+2} A_{i+3} A_{i+4},1\leq i\leq 66,$ which have an inscribed circle? ($A_{66+i}\equiv A_i$).

The real numbers $a$, $b$, $c$, $d$ satisfy simultaneously the equations \[abc -d = 1, \ \ \ bcd - a = 2, \ \ \ cda- b = 3, \ \ \ dab - c = -6.\] Prove that $a + b + c + d \not = 0$.

Let $BC$ and $BD$ be the tangent lines to the circle with diameter $AC$. Let $E$ be the second point of intersection of line $CD$ and the circumscribed circle of triangle $ABC$. Prove that $CD= 2DE$. (Matthew Kurskyi)

Gordon has the least number of coins (half-dollars, quarters, dimes, nickels, pennies) needed to make $99\cent$. He randomly chooses one. What is the probability that it is a penny? $\textbf{(A) } \dfrac15\qquad\textbf{(B) } \dfrac13\qquad\textbf{(C) } \dfrac12\qquad\textbf{(D) } \dfrac23\qquad\textbf{(E) } \dfrac34$

Find all functions $f : \mathbb{R} \to \mathbb{R}$ that satisfy \[f(x^2 + y) + f(f(x) - y) = 2f(f(x)) + 2y^2\quad\text{ for all }x, y \in \mathbb{R}.\]

Let $p$ be a prime number and let $\mathbb{F}_p$ be the finite field with $p$ elements. Consider an automorphism $\tau$ of the polynomial ring $\mathbb{F}_p[x]$ given by \[\tau(f)(x)=f(x+1).\] Let $R$ denote the subring of $\mathbb{F}_p[x]$ consisting of those polynomials $f$ with $\tau(f)=f$. Find a polynomial $g \in \mathbb{F}_p[x]$ such that $\mathbb{F}_p[x]$ is a free module over $R$ with basis $g,\tau(g),\dots,\tau^{p-1}(g)$.

The complex number $z$ satisfies $z + |z| = 2 + 8i$. What is $|z|^{2}$? Note: if $z = a + bi$, then $|z| = \sqrt{a^{2} + b^{2}}$. $ \textbf{(A)}\ 68\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 169\qquad\textbf{(D)}\ 208\qquad\textbf{(E)}\ 289 $

How many pairs $(a, b)$ for integers $1 \le a, b \le 2015$ which satisfy that $a$ is divisible by $b + 1$ and $2016 - a$ is divisible by $b$.

Given a polynomial $P(x) = a_nx^n + a_{n-1}x^{n-1} + ...+ a_1x + a_0$ of real coefficients. Suppose that $P(x)$ has $n$ real roots (not necessarily distinct), and there exists a positive integer $k$ such that $a_k = a_{k-1} = 0$. Prove that $P(x)$ has a real root of multiplicity $k + 1$.

Find all positive integers, representable uniquely as \[\frac{x^{2}+y}{xy+1},\] where $x$ and $y$ are positive integers.

Let $ABC$ be an equilateral triangle of sidelength 2 and let $\omega$ be its incircle. a) Show that for every point $P$ on $\omega$ the sum of the squares of its distances to $A$, $B$, $C$ is 5. b) Show that for every point $P$ on $\omega$ it is possible to construct a triangle of sidelengths $AP$, $BP$, $CP$. Also, the area of such triangle is $\frac{\sqrt{3}}{4}$.

Each pair of vertices of a regular 10-sided polygon is connected by a line segment. How many unordered pairs of distinct parallel line segments can be chosen from these segments? [i]Author: Ray Li[/i]

A number is called a palindromic number if its decimal representation read from the left to the right is the same as read from the right to the left. Let $(x_n)$ be the increasing sequence of all palindromic numbers. Determine all primes, which are divisors of at least one of the differences $x_{n+1} - x_n$.

Consider the sets $A = \{0,1,2\},$ and $B = \{1,2,3,4,5\}.$ Find the number of functions $f: A \to B$ such that $x + f(x) + xf(x)$ is odd for all $x.$ (A function $f:A \to B$ is a rule that assigns to every number in $A$ a number in $B.$) \[\mathrm a. ~15\qquad \mathrm b. ~27 \qquad \mathrm c. ~30 \qquad\mathrm d. ~42\qquad\mathrm e. ~45\]

Given a positive integer $k$, call $n$ [i]good[/i] if among $$\binom{n}{0},\binom{n}{1},\binom{n}{2},...,\binom{n}{n}$$ at least $0.99n$ of them are divisible by $k$. Show that exists some positive integer $N$ such that among $1,2,...,N$, there are at least $0.99N$ good numbers.

For any positive integer $n$, define $f(n)$ to be the smallest positive integer that does not divide $n$. For example, $f(1)=2$, $f(6)=4$. Prove that for any positive integer $n$, either $f(f(n))$ or $f(f(f(n)))$ must be equal to $2$.

There are seven cards in a hat, and on the card $k$ there is a number $2^{k-1}$, $k=1,2,...,7$. Solarin picks the cards up at random from the hat, one card at a time, until the sum of the numbers on cards in his hand exceeds $124$. What is the most probable sum he can get?

[u]Round 1[/u] [b]p1.[/b] Alec rated the movie Frozen $1$ out of $5$ stars. At least how many ratings of $5$ out of $5$ stars does Eric need to collect to make the average rating for Frozen greater than or equal to $4$ out of $5$ stars? [b]p2.[/b] Bessie shuffles a standard $52$-card deck and draws five cards without replacement. She notices that all five of the cards she drew are red. If she draws one more card from the remaining cards in the deck, what is the probability that she draws another red card? [b]p3.[/b] Find the value of $121 \cdot 1020304030201$. [u]Round 2[/u] [b]p4.[/b] Find the smallest positive integer $c$ for which there exist positive integers $a$ and $b$ such that $a \ne b$ and $a^2 + b^2 = c$ [b]p5.[/b] A semicircle with diameter $AB$ is constructed on the outside of rectangle $ABCD$ and has an arc length equal to the length of $BC$. Compute the ratio of the area of the rectangle to the area of the semicircle. [b]p6.[/b] There are $10$ monsters, each with $6$ units of health. On turn $n$, you can attack one monster, reducing its health by $n$ units. If a monster's health drops to $0$ or below, the monster dies. What is the minimum number of turns necessary to kill all of the monsters? [u]Round 3[/u] [b]p7.[/b] It is known that $2$ students make up $5\%$ of a class, when rounded to the nearest percent. Determine the number of possible class sizes. [b]p8.[/b] At $17:10$, Totoro hopped onto a train traveling from Tianjin to Urumuqi. At $14:10$ that same day, a train departed Urumuqi for Tianjin, traveling at the same speed as the $17:10$ train. If the duration of a one-way trip is $13$ hours, then how many hours after the two trains pass each other would Totoro reach Urumuqi? [b]p9.[/b] Chad has $100$ cookies that he wants to distribute among four friends. Two of them, Jeff and Qiao, are rivals; neither wants the other to receive more cookies than they do. The other two, Jim and Townley, don't care about how many cookies they receive. In how many ways can Chad distribute all $100$ cookies to his four friends so that everyone is satisfied? (Some of his four friends may receive zero cookies.) [u]Round 4[/u] [b]p10.[/b] Compute the smallest positive integer with at least four two-digit positive divisors. [b]p11.[/b] Let $ABCD$ be a trapezoid such that $AB$ is parallel to $CD$, $BC = 10$ and $AD = 18$. Given that the two circles with diameters $BC$ and $AD$ are tangent, find the perimeter of $ABCD$. [b]p12.[/b] How many length ten strings consisting of only $A$s and Bs contain neither "$BAB$" nor "$BBB$" as a substring? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2934037p26256063]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].