Calamitous Clod deceives the math beasts by changing a clock at Beast Academy. First, he removes both the minute and hour hands, then places each of them back in a random position, chosen uniformly along the circle. Professor Grok notices that the clock is not displaying a valid time. That is, the hour and minute hands are pointing in an orientation that a real clock would never display. One such example is the hour hand pointed at $6$ and the minute hand pointed at $3$. [center] [asy] import olympiad; size(4cm); defaultpen(fontsize(8pt)); draw(circle(origin, 4)); dot(origin); for(int i = 1; i <= 12; ++i){ label("$"+string(i)+"$", (3.6*sin(i * pi/6), 3.6*cos(i * pi/6))); } draw(origin -- (3.2, 0), EndArrow(5)); draw(origin -- (0, -2.2), EndArrow(5)); [/asy] [/center] The math beasts can fix this, though. They can turn both hands by the same number of degrees clockwise. On average, what is the minimal number of degrees they must turn the hands so that they display a valid time?

Find all functions $f: \mathbb{Q^+} \rightarrow \mathbb{Q}$ satisfying $f(x)+f(y)= \left(f(x+y)+\frac{1}{x+y} \right) (1-xy+f(xy))$ for all $x, y \in \mathbb{Q^+}$.

Find the number of positive integers $m$ for which there exist nonnegative integers $x_0,x_1,\ldots,x_{2011}$ such that \[ m^{x_0}=\sum_{k=1}^{2011}m^{x_k}. \]

Adam has a circle of radius $1$ centered at the origin. - First, he draws $6$ segments from the origin to the boundary of the circle, which splits the upper (positive $y$) semicircle into $7$ equal pieces. - Next, starting from each point where a segment hit the circle, he draws an altitude to the $x$-axis. - Finally, starting from each point where an altitude hit the $x$-axis, he draws a segment directly away from the bottommost point of the circle $(0,-1)$, stopping when he reaches the boundary of the circle. What is the product of the lengths of all $18$ segments Adam drew? [img]https://cdn.discordapp.com/attachments/813077401265242143/816190774257516594/circle2.png[/img] [i]Proposed by Adam Bertelli[/i]

Find all functions $f:(0,\infty)\rightarrow (0,\infty)$ such that for any $x,y\in (0,\infty)$, $$xf(x^2)f(f(y)) + f(yf(x)) = f(xy) \left(f(f(x^2)) + f(f(y^2))\right).$$

Let $n\geq 3$ be an odd integer. Determine how many real solutions there are to the set of $n$ equations \[\left\{\begin{array}{cc}x_1(x_1+1)=x_2(x_2-1)\\x_2(x_2+1)=x_3(x_3-1)\\ \vdots \\ x_n(x_n+1) = x_1(x_1-1)\end{array}\right.\]

Determine all the functions $f : R \to R$ such that: $$x + f(xf(y)) = f(y) + yf(x)$$ for all $x, y \in R$.

Let $a,b$ and $c$ be positive real numbers satisfying $\min(a+b,b+c,c+a) > \sqrt{2}$ and $a^2+b^2+c^2=3.$ Prove that \[\frac{a}{(b+c-a)^2} + \frac{b}{(c+a-b)^2} + \frac{c}{(a+b-c)^2} \geq \frac{3}{(abc)^2}.\] [i]Proposed by Titu Andreescu, Saudi Arabia[/i]

Determine all 4-tuples ($a, b,c, d$) of real numbers satisfying the following four equations: $\begin{cases} ab + c + d = 3 \\ bc + d + a = 5 \\ cd + a + b = 2 \\ da + b + c = 6 \end{cases}$

For all positive real numbers $a_1, a_2, \dots, a_n$, prove that $$ \frac{a_1\! +\! a_2}{2} \cdot \frac{a_2\! +\! a_3}{2} \cdot \dots \cdot \frac{a_n\! +\! a_1}{2} \leq \frac{a_1\!+\!a_2\!+\!a_3}{2 \sqrt{2}} \cdot \frac{a_2\!+\!a_3\!+\!a_4}{2 \sqrt{2}} \cdot \dots \cdot \frac{a_n\!+\!a_1\!+\!a_2}{2 \sqrt{2}}.$$

Find all real numbers $a$ such that there exists a function $f:\mathbb R\to \mathbb R$ such that the following conditions are simultaneously satisfied: (a) $f(f(x))=xf(x)-ax,\;\forall x\in\mathbb{R};$ (b) $f$ is not a constant function; (c) $f$ takes the value $a$.

Let $x_1,x_2,\ldots,x_n$ be arbitrary real numbers. Prove the inequality \[ \frac{x_1}{1+x_1^2} + \frac{x_2}{1+x_1^2 + x_2^2} + \cdots + \frac{x_n}{1 + x_1^2 + \cdots + x_n^2} < \sqrt{n}. \]

Determine the largest integer $c$ for which the following statement holds: there exists at least one triple $(x,y,z)$ of integers such that \begin{align*} x^2 + 4(y + z) = y^2 + 4(z + x) = z^2 + 4(x + y) = c \end{align*} and all triples $(x,y,z)$ of real numbers, satisfying the equations, are such that $x,y,z$ are integers. [i]Marek Maruin, Slovakia [/i]

Let $ u_1$, $ u_2$, $ \ldots$, $ u_{1987}$ be an arithmetic progression with $ u_1 \equal{} \frac {\pi}{1987}$ and the common difference $ \frac {\pi}{3974}$. Evaluate \[ S \equal{} \sum_{\epsilon_i\in\left\{ \minus{} 1, 1\right\}}\cos\left(\epsilon_1 u_1 \plus{} \epsilon_2 u_2 \plus{} \cdots \plus{} \epsilon_{1987} u_{1987}\right) \]

[u]Round 1[/u] [b]p1.[/b] Ash is running around town catching Pokémon. Each day, he may add $3, 4$, or $5$ Pokémon to his collection, but he can never add the same number of Pokémon on two consecutive days. What is the smallest number of days it could take for him to collect exactly $100$ Pokémon? [b]p2.[/b] Jack and Jill have ten buckets. One bucket can hold up to $1$ gallon of water, another can hold up to $2$ gallons, and so on, with the largest able to hold up to $10$ gallons. The ten buckets are arranged in a line as shown below. Jack and Jill can pour some amount of water into each bucket, but no bucket can have less water than the one to its left. Is it possible that together, the ten buckets can hold 36 gallons of water? [img]https://cdn.artofproblemsolving.com/attachments/f/8/0b6524bebe8fe859fe7b1bc887ac786106fc17.png[/img] [b]p3.[/b] There are $2023$ knights and liars standing in a row. Knights always tell the truth and liars always lie. Each of them says, “the number of liars to the left of me is greater than the number of knights to the right.” How many liars are there? [b]p4.[/b] Camila has a deck of $101$ cards numbered $1, 2, ..., 101$. She starts with $50$ random cards in her hand and the rest on a table with the numbers visible. In an exchange, she replaces all $50$ cards in her hand with her choice of $50$ of the $51$ cards from the table. Show that Camila can make at most 50 exchanges and end up with cards $1, 2, ..., 50$. [img]https://cdn.artofproblemsolving.com/attachments/0/6/c89e65118764f3b593da45264bfd0d89e95067.png[/img] [b]p5.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [u]Round 2[/u] [b]p6.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company will lay lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses. The Edison lighting company will hang strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [b]p7.[/b] You are given a sequence of $16$ digits. Is it always possible to select one or more digits in a row, so that multiplying them results in a square number? [img]https://cdn.artofproblemsolving.com/attachments/d/1/f4fcda2e1e6d4a1f3a56cd1a04029dffcd3529.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given non-constant linear functions $p_1(x), p_2(x), \dots p_n(x)$. Prove that at least $n-2$ of polynomials $p_1p_2\dots p_{n-1}+p_n, p_1p_2\dots p_{n-2} p_n + p_{n-1},\dots p_2p_3\dots p_n+p_1$ have a real root.

Let $$a_k = 0.\overbrace{0 \ldots 0}^{k - 1 \: 0's} 1 \overbrace{0 \ldots 0}^{k - 1 \: 0's} 1$$ The value of $\sum_{k = 1}^\infty a_k$ can be expressed as a rational number $\frac{p}{q}$ in simplest form. Find $p + q$.

A function $f(n)$ is defined on the set of positive integers is said to be multiplicative if $f(mn)=f(m)f(n)$ whenever $m$ and $n$ have no common factors greater than $1$. Are the following functions multiplicative? Justify your answer. (a) $g(n)=5^k$ where $k$ is the number of distinct primes which divide $n$. (b) $h(n)=\begin{cases} 0 & \text{if} \ n \ \text{is divisible by} \ k^2 \ \text{for some integer} \ k>1 \\ 1 & \text{otherwise} \end{cases}$

A sequence $a_1,a_2,\dots$ satisfy $$ \sum_{i =1}^n a_{\lfloor \frac{n}{i}\rfloor }=n^{10}, $$ for every $n\in\mathbb{N}$. Let $c$ be a positive integer. Prove that, for every positive integer $n$, $$ \frac{c^{a_n}-c^{a_{n-1}}}{n} $$ is an integer.

If $a,b,c$ are real numbers such that $a^2+2b=7$, $b^2+4c=-7$, and $c^2+6a=-14$, find $a^2+b^2+c^2$. $\textbf{(A) }14\qquad\textbf{(B) }21\qquad\textbf{(C) }28\qquad\textbf{(D) }35\qquad\textbf{(E) }49$

Find all functions $f:\mathbb R\to\mathbb R$ such that for reals $x,y$, $$f(xf(y)+y)=yf(x)+f(y).$$

Let $a, b, c$ be positive real numbers satisfying \[a+b+c = a^2 + b^2 + c^2.\] Let \[M = \max\left(\frac{2a^2}{b} + c, \frac{2b^2}{a} + c \right) \quad \text{ and } \quad N = \min(a^2 + b^2, c^2).\] Find the minimum possible value of $M/N$.

$(a)$There are two sequences of numbers, with $2003$ consecutive integers each, and a table of $2$ rows and $2003$ columns $\begin{array}{|c|c|c|c|c|c|} \hline\ \ &\ &\ &\cdots\cdots&\ &\ \\ \hline \ &\ &\ &\cdots\cdots&\ &\ \\ \hline \end{array}$ Is it always possible to arrange the numbers in the first sequence in the first row and the second sequence in the second row, such that the sequence obtained of the $2003$ column-wise sums form a new sequence of $2003$ consecutive integers? $(b)$ What if $2003$ is replaced with $2004$?

ِDo there exist non-zero reals numbers $a_1, a_2, ....., a_{10}$ for which \[(a_1+\frac{1}{a_1})(a_2+\frac{1}{a_2}) \cdots(a_{10}+\frac{1}{a_{10}})= (a_1-\frac{1}{a_1})(a_2-\frac{1}{a_2})\cdots(a_{10}-\frac{1}{a_{10}}) \ ? \]

Let $n$ be a positive integer. There are $n$ soldiers stationed on the $n$th root of unity in the complex plane. Each round, you pick a point, and all the soldiers shoot in a straight line towards that point; if their shot hits another soldier, the hit soldier dies and no longer shoots during the next round. What is the minimum number of rounds, in terms of $n$, required to eliminate all the soldiers? [i]David Yang.[/i]