$P_k(n) $ is the product of all positive divisors of $n$ that are divisible by $k$ (the empty product is equal to $1$). Show that $P_1(n)P_2(n)\cdots P_n(n)$ is a perfect square, for any positive integer $n$.

Given seven points on a plane, with no three points collinear. Prove that it is always possible to divide these points into the vertices of a triangle and a convex quadrilateral, with no shared parts between the two shapes.

A circle $\omega$ with diameter $AK$ is given. The point $M$ lies in the interior of the circle, but not on $AK$. The line $AM$ intersects $\omega$ in $A$ and $Q$. The tangent to $\omega$ at $Q$ intersects the line through $M$ perpendicular to $AK$, at $P$. The point $L$ lies on $\omega$, and is such that $PL$ is tangent to $\omega$ and $L\neq Q$. Show that $K, L$, and $M$ are collinear.

Let $I$ be the incenter of $\triangle ABC$ with $AB>AC$. Let $\Gamma$ be the circle with diameter $AI$. The circumcircle of $\triangle ABC$ intersects $\Gamma$ at points $A,D$, with point $D$ lying on $\overarc{AC}$ (not containing $B$). Let the line passing through $A$ and parallel to $BC$ intersect $\Gamma$ at points $A,E$. If $DI$ is the angle bisector of $\angle CDE$, and $\angle ABC = 33^{\circ}$, find the value of $\angle BAC$.

Find (i) $\lim_{n\to \infty} \sum_{i=1}^{n} \frac{1}{\sqrt{n^2 +i^{2}}}$. (ii) $\lim_{n\to \infty} \sum_{i=1}^{n} \frac{1}{\sqrt{n^2 +i}}$. (iii) $\lim_{n\to \infty} \sum_{i=1}^{n^{2}} \frac{1}{\sqrt{n^2 +i}}$.

Let $E$ be a common point of circles $\omega _1$ and $\omega _2$. Let $AB$ be a common tangent to these circles, and $CD$ be a line parallel to $AB$, such that $A$ and $C$ lie on $\omega _1$, $B$ and $D$ lie on $\omega _2$. The circles $ABE$ and $CDE$ meet for the second time at point $F$. Prove that $F$ bisects one of arcs $CD$ of circle $CDE$.

[u]Round 1[/u] [b]p1.[/b] This year, the Mathathon consists of $7$ rounds, each with $3$ problems. Another math test, Aspartaime, consists of $3$ rounds, each with $5$ problems. How many more problems are on the Mathathon than on Aspartaime? [b]p2.[/b] Let the solutions to $x^3 + 7x^2 - 242x - 2016 = 0 $be $a, b$, and $c$. Find $a^2 + b^2 + c^2$. (You might find it helpful to know that the roots are all rational.) [b]p3.[/b] For triangle $ABC$, you are given $AB = 8$ and $\angle A = 30^o$ . You are told that $BC$ will be chosen from amongst the integers from $1$ to $10$, inclusive, each with equal probability. What is the probability that once the side length $BC$ is chosen there is exactly one possible triangle $ABC$? [u]Round 2 [/u] [b]p4.[/b] It’s raining! You want to keep your cat warm and dry, so you want to put socks, rain boots, and plastic bags on your cat’s four paws. Note that for each paw, you must put the sock on before the boot, and the boot before the plastic bag. Also, the items on one paw do not affect the items you can put on another paw. How many different orders are there for you to put all twelve items of rain footwear on your cat? [b]p5.[/b] Let $a$ be the square root of the least positive multiple of $2016$ that is a square. Let $b$ be the cube root of the least positive multiple of $2016$ that is a cube. What is $ a - b$? [b]p6.[/b] Hypersomnia Cookies sells cookies in boxes of $6, 9$ or $10$. You can only buy cookies in whole boxes. What is the largest number of cookies you cannot exactly buy? (For example, you couldn’t buy $8$ cookies.) [u]Round 3 [/u] [b]p7.[/b] There is a store that sells each of the $26$ letters. All letters of the same type cost the same amount (i.e. any ‘a’ costs the same as any other ‘a’), but different letters may or may not cost different amounts. For example, the cost of spelling “trade” is the same as the cost of spelling “tread,” even though the cost of using a ‘t’ may be different from the cost of an ‘r.’ If the letters to spell out $1$ cost $\$1001$, the letters to spell out $2$ cost $\$1010$, and the letters to spell out $11$ cost $\$2015$, how much do the letters to spell out $12$ cost? [b]p8.[/b] There is a square $ABCD$ with a point $P$ inside. Given that $PA = 6$, $PB = 9$, $PC = 8$. Calculate $PD$. [b]p9.[/b] How many ordered pairs of positive integers $(x, y)$ are solutions to $x^2 - y^2 = 2016$? [u]Round 4 [/u] [b]p10.[/b] Given a triangle with side lengths $5, 6$ and $7$, calculate the sum of the three heights of the triangle. [b]p11. [/b]There are $6$ people in a room. Each person simultaneously points at a random person in the room that is not him/herself. What is the probability that each person is pointing at someone who is pointing back to them? [b]p12.[/b] Find all $x$ such that $\sum_{i=0}^{\infty} ix^i =\frac34$. PS. You should use hide for answers. Rounds 5-7 have been posted [url=https://artofproblemsolving.com/community/c4h2782837p24446063]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $A$, $B$, $C$, $D$, $E$, $F$ be six points on a circle such that $AE\parallel BD$ and $BC\parallel DF$. Let $X$ be the reflection of the point $D$ in the line $CE$. Prove that the distance from the point $X$ to the line $EF$ equals to the distance from the point $B$ to the line $AC$.

Do there exist positive integers $a$ and $b$ such that $a^n+n^b$ and $b^n+n^a$ are relatively prime for all natural $n$?

For each positive integer $n$, let $f_1(n)$ be twice the number of positive integer divisors of $n$, and for $j \ge 2$, let $f_j(n) = f_1(f_{j-1}(n))$. For how many values of $n \le 50$ is $f_{50}(n) = 12?$ $\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11$

Susan had $\$50$ to spend at the carnival. She spent $\$12$ on food and twice as much on rides. How many dollars did she have left to spend? $\textbf{(A)}\ 12 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 26 \qquad \textbf{(D)}\ 38 \qquad \textbf{(E)}\ 50 $

Let $n$ and $q$ be two natural numbers, $n\ge 2$, $q\ge 2$ and $q\not\equiv 1 (\text{mod}\ 4)$ and let $K$ be a finite field which has exactly $q$ elements. Show that for any element $a$ from $K$, there exist $x$ and $y$ in $K$ such that $a = x^{2^n} + y^{2^n}$. (Every finite field is commutative).

Let $P_n(x)=a_0 + a_1x + \cdots + a_nx^n$, with $n \geq 2$, be a real-coefficient polynomial. Prove that if there exists $a > 0$ such that \begin{align*} P_n(x) = (x + a)^2 \left( \sum_{i=0}^{n-2} b_i x^i \right), \end{align*} where $b_i$ are positive real numbers, then there exists some $i$, with $1 \leq i \leq n-1$, such that \[a_i^2 - 4a_{i-1}a_{i+1} \leq 0.\]

The fraction $\frac23$ can be eypressed as a sum of two distinct unit fractions: $\frac12 + \frac16$ . Show that the fraction $\frac{p-1}{p}$ where $p\ge 5$ is a prime cannot be expressed as a sum of two distinct unit fractions.

Let $ABCD$ be the trapezium with bases $AB$ and $CD$, such that $\sphericalangle ABC = 90^{\circ}$. The bisector of angle $BAD$ intersects the segment $BC$ in the point $P$. Show that if $\sphericalangle APD = 45^{\circ}$, then area of quadrilateral $APCD$ is equal to the area of the triangle $ABP$.

[b]a)[/b] Solve the equation $ x^2-x+2\equiv 0\pmod 7. $ [b]b)[/b] Determine the natural numbers $ n\ge 2 $ for which the equation $ x^2-x+2\equiv 0\pmod n $ has an unique solution modulo $ n. $

Let $n$ $\geq$ $2$ and $k$ $\geq$ $2$ be positive integers. A cat and a mouse are playing [i]Wim[/i], which is a stone removal game. The game starts with $n$ stones and they take turns removing stones, with the cat going first. On each turn they are allowed to remove $1$, $2$, $\dotsb$, or $k$ stones, and the player who cannot remove any stones on their turn loses. \\\\ A raccoon finds Wim very boring and creates [i]Wim 2[/i], which is Wim but with the following additional rule: [i]You cannot remove the same number of stones that your opponent removed on the previous turn[/i]. \\\\Find all values of $k$ such that for every $n$, the cat has a winning strategy in Wim if and only if it has a winning strategy in Wim 2.

The units digit of $3^{1001}7^{1002}13^{1003}$ is $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 9 $

Let $a_1,a_2,...,a_m(m\geq 1)$ be all the positive divisors of $n$. If there exist $m$ integers $b_1,b_2,...b_m$ such that $n=\sum_{i=1}^m (-1)^{b_i} a_i$, then $n$ is a $\textit{good}$ number. Prove that there exist a good number with exactly $2013$ distinct prime factors.

Let $S$ be the set of positive integers $N$ with the property that the last four digits of $N$ are $2020$, and when the last four digits are removed, the result is a divisor of $N$. For example, $42,020$ is in $S$ because $4$ is a divisor of $42,020$. Find the sum of all the digits of all the numbers in $S$. For example, the number $42,020$ contributes $4+2+0+2+0=8$ to this total.

Let $ABC$ be an acute triangle with circumcircle $\omega$. Let $D$ and $E$ be the feet of the altitudes from $B$ and $C$ onto sides $AC$ and $AB$, respectively. Lines $BD$ and $CE$ intersect $\omega$ again at points $P \neq B$ and $Q \neq C$. Suppose that $PD=3$, $QE=2$, and $AP \parallel BC$. Compute $DE$. [i]Proposed by Kyle Lee[/i]

Let $H$ be the orthocenter of an acute-angled triangle $ABC$; $E$, $F$ be points on $AB, AC$ respectively, such that $AEHF$ is a parallelogram; $X, Y$ be the common points of the line $EF$ and the circumcircle $\omega$ of triangle $ABC$; $Z$ be the point of $\omega$ opposite to $A$. Prove that $H$ is the orthocenter of triangle $XYZ$.

Mr. Ganzgenau would like to take his tea mug out of the microwave right at the front. But Mr. Ganzgenau's microwave doesn't really want to be very precise play along. To be precise, the two of them play the following game: Let $n$ be a positive integer. The turntable of the microwave makes one in $n$ seconds full turn. Each time the microwave is switched on, an integer number of seconds turned either clockwise or counterclockwise so that there are n possible positions in which the tea mug can remain. One of these positions is right up front. At the beginning, the microwave turns the tea mug to one of the $n$ possible positions. After that Mr. Ganzgenau enters an integer number of seconds in each move, and the microwave decides either clockwise or counterclockwise this number of spin for seconds. For which $n$ can Mr. Ganzgenau force the tea cup after a finite number of puffs to be able to take it out of the microwave right up front? (Birgit Vera Schmidt) [hide=original wording, in case it doesn't make much sense]Herr Ganzgenau möchte sein Teehäferl ganz genau vorne aus der Mikrowelle herausnehmen. Die Mikrowelle von Herrn Ganzgenau möchte da aber so ganz genau gar nicht mitspielen. Ganz genau gesagt spielen die beiden das folgende Spiel: Sei n eine positive ganze Zahl. In n Sekunden macht der Drehteller der Mikrowelle eine vollständige Umdrehung. Bei jedem Einschalten der Mikrowelle wird eine ganzzahlige Anzahl von Sekunden entweder im oder gegen den Uhrzeigersinn gedreht, sodass es n mögliche Positionen gibt, auf denen das Teehäferl stehen bleiben kann. Eine dieser Positionen ist ganz genau vorne. Zu Beginn dreht die Mikrowelle das Teehäferl auf eine der n möglichen Positionen. Danach gibt Herr Ganzgenau in jedem Zug eine ganzzahlige Anzahl von Sekunden ein, und die Mikrowelle entscheidet, entweder im oder gegen den Uhrzeigersinn diese Anzahl von Sekunden lang zu drehen. Für welche n kann Herr Ganzgenau erzwingen, das Teehäferl nach endlich vielen Zügen ganz genau vorne aus der Mikrowelle nehmen zu können? (Birgit Vera Schmidt) [/hide]

What is the sum of the digits of the smallest prime that can be written as a sum of $5$ distinct primes? $\textbf{(A) }5\qquad\textbf{(B) }7\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11$

Let $S=\{(x,y,z)\in \mathbb{Z}^3\}$ the set of points with integer coordinates in the space. Gugu has infinitely many solid spheres. All with radii $\ge (\frac{\pi}2)^3$. Is it possible for Gugu to cover all points of $S$ with his spheres?