Consider a function $f: \mathbb Z \to \mathbb Z$ such that for every integer $n \ge 0$, there are at most $0.001n^2$ pairs of integers $(x,y)$ for which $f(x+y) \neq f(x)+f(y)$ and $\max\{ \lvert x \rvert, \lvert y \rvert \} \le n$. Is it possible that for some integer $n \ge 0$, there are more than $n$ integers $a$ such that $f(a) \neq a \cdot f(1)$ and $\lvert a \rvert \le n$? [i]Proposed by David Yang[/i]

Prove that there exists an infinite set of points \[ \dots, \; P_{-3}, \; P_{-2},\; P_{-1},\; P_0,\; P_1,\; P_2,\; P_3,\; \dots \] in the plane with the following property: For any three distinct integers $a,b,$ and $c$, points $P_a$, $P_b$, and $P_c$ are collinear if and only if $a+b+c=2014$.

Let $f(x)$ be a function such that $f(x)+2f\left(\frac{x+2010}{x-1}\right)=4020 - x$ for all $x \ne 1$. Then the value of $f(2012)$ is (A) $2010$, (B) $2011$, (C) $2012$, (D) $2014$, (E) None of the above.

Prove that one can cut $a \times b$ rectangle, $\frac{b}{2} < a < b$, into three pieces and rearrange them into a square (without overlaps and holes).

Find the point $ p $ in the first quadrant on the line $ y = 2x $ such that the distance between $ p $ and $ p' $, the point reflected across the line $ y = x $, is equal to $ \sqrt{32} $.

Evaluate the following integrals. (1) $\int_0^{\pi} \cos mx\cos nx\ dx\ (m,\ n=1,\ 2,\ \cdots).$ (2) $\int_1^3 \left(x-\frac{1}{x}\right)(\ln x)^2dx.$

Prove the following inequality $$\dfrac{6}{2024^3} < \left(1-\dfrac{3}{4}\right)\left(1-\dfrac{3}{5}\right)\left(1-\dfrac{3}{6}\right)\left(1-\dfrac{3}{7}\right)\ldots\left(1-\dfrac{3}{2025}\right).$$

$d$ is a positive integer and $f : [0,d] \rightarrow \mathbb{R}$ is a continuous function with $f(0) = f(d)$. Show that there exists $x \in [0,d-1]$ such that $f(x) = f(x+1)$.

For natural numbers, when $P$ is divided by $D$, the quotient is $Q$ and the remainder is $R$. When $Q$ is divided by $D'$, the quotient is $Q'$ and the remainder is $R'$. Then, when $P$ is divided by $DD'$, the remainder is: $\textbf{(A)}\ R+R'D\qquad \textbf{(B)}\ R'+RD\qquad \textbf{(C)}\ RR'\qquad \textbf{(D)}\ R\qquad \textbf{(E)}\ R'$

If $ P(x),Q(x),R(x)$, and $ S(x)$ are all polynomials such that \[ P(x^5)\plus{}xQ(x^5)\plus{}x^2R(x^5)\equal{}(x^4\plus{}x^3\plus{}x^2\plus{}x\plus{}1)S(x),\] prove that $ x\minus{}1$ is a factor of $ P(x)$.

There are 10 numbers on a board. The product of any four of them is divisible by 30. Prove that at least one of the numbers on the board is divisible by 30.

Prove that the sum of two nagelians is greater than the semiperimeter of a triangle. (The nagelian is the segment between the vertex of a triangle and the tangency point of the opposite side with the correspondent excircle.)

In The ring $\mathbf R$, we have $\forall x \in \mathbf R : x^2=x$. Prove that in this ring [b]i)[/b] Every element is equals to its additive inverse. [b]ii)[/b] This ring has commutative property.

Given $\cos (\alpha + \beta) + sin (\alpha - \beta) = 0$, $\tan \beta =\frac{1}{2000}$, find $\tan \alpha$.

Let $ABCDE$ be a regular pentagon. We drew two circles around $A$ and $B$ with radius $AB$. Let $F$ mark the intersection of the two circles that is inside the pentagon. Let $G$ mark the intersection of lines $EF$ and $AD$. What is the degree measure of angle $AGE$?

Two consecutive positive integers $n$ and $n+1$ have the property that they both have $6$ divisors but a different number of distinct prime factors. Find the sum of the possible values of $n$. [i]Proposed by Harry Kim[/i]

Find all the continuous functions $f : \mathbb{R} \mapsto\mathbb{R}$ such that $\forall x,y \in \mathbb{R}$, $(1+f(x)f(y))f(x+y)=f(x)+f(y)$.

[u]Round 5[/u] [b]p13.[/b] In coordinate space, a lattice point is a point all of whose coordinates are integers. The lattice points $(x, y, z)$ in three-dimensional space satisfying $0 \le x, y, z \le 5$ are colored in n colors such that any two points that are $\sqrt3$ units apart have different colors. Determine the minimum possible value of $n$. [b]p14.[/b] Determine the number of ways to express $121$ as a sum of strictly increasing positive Fibonacci numbers. [b]p15.[/b] Let $ABCD$ be a rectangle with $AB = 7$ and $BC = 15$. Equilateral triangles $ABP$, $BCQ$, $CDR$, and $DAS$ are constructed outside the rectangle. Compute the area of quadrilateral $P QRS$. [u] Round 6[/u] Each of the three problems in this round depends on the answer to one of the other problems. There is only one set of correct answers to these problems; however, each problem will be scored independently, regardless of whether the answers to the other problems are correct. [b]p16.[/b] Let $C$ be the answer to problem $18$. Suppose that $x$ and $y$ are real numbers with $y > 0$ and $$x + y = C$$ $$x +\frac{1}{y} = -2.$$ Compute $y +\frac{1}{y}$. [b]p17.[/b] Let $A$ be the answer to problem $16$. Let $P QR$ be a triangle with $\angle P QR = 90^o$, and let $X$ be the foot of the perpendicular from point $Q$ to segment $P R$. Given that $QX = A$, determine the minimum possible area of triangle $PQR$. [b]p18.[/b] Let $B$ be the answer to problem $17$ and let $K = 36B$. Alice, Betty, and Charlize are identical triplets, only distinguishable by their hats. Every day, two of them decide to exchange hats. Given that they each have their own hat today, compute the probability that Alice will have her own hat in $K$ days. [u]Round 7[/u] [b]p19.[/b] Find the number of positive integers a such that all roots of $x^2 + ax + 100$ are real and the sum of their squares is at most $2013$. [b]p20.[/b] Determine all values of $k$ such that the system of equations $$y = x^2 - kx + 1$$ $$x = y^2 - ky + 1$$ has a real solution. [b]p21.[/b] Determine the minimum number of cuts needed to divide an $11 \times 5 \times 3$ block of chocolate into $1\times 1\times 1$ pieces. (When a block is broken into pieces, it is permitted to rotate some of the pieces, stack some of the pieces, and break any set of pieces along a vertical plane simultaneously.) [u]Round 8[/u] [b]p22.[/b] A sequence that contains the numbers $1, 2, 3, ... , n$ exactly once each is said to be a permutation of length $n$. A permutation $w_1w_2w_3... w_n$ is said to be sad if there are indices $i < j < k$ such that $w_j > w_k$ and $w_j > w_i$. For example, the permutation $3142756$ is sad because $7 > 6$ and $7 > 1$. Compute the number of permutations of length $11$ that are not sad. [b]p23.[/b] Let $ABC$ be a triangle with $AB = 39$, $BC = 56$, and $CA = 35$. Compute $\angle CAB - \angle ABC$ in degrees. [b]p24.[/b] On a strange planet, there are $n$ cities. Between any pair of cities, there can either be a one-way road, two one-way roads in different directions, or no road at all. Every city has a name, and at the source of every one-way road, there is a signpost with the name of the destination city. In addition, the one-way roads only intersect at cities, but there can be bridges to prevent intersections at non-cities. Fresh Mann has been abducted by one of the aliens, but Sophy Moore knows that he is in Rome, a city that has no roads leading out of it. Also, there is a direct one-way road leading from each other city to Rome. However, Rome is the secret police’s name for the so-described city; its official name, the name appearing on the labels of the one-way roads, is unknown to Sophy Moore. Sophy Moore is currently in Athens and she wants to head to Rome in order to rescue Fresh Mann, but she does not know the value of $n$. Assuming that she tries to minimize the number of roads on which she needs to travel, determine the maximum possible number of roads that she could be forced to travel in order to find Rome. Express your answer as a function of $n$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2809419p24782489]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]

A set of five-digit numbers $\{N_1, ...,N_k\}$ is such that any five-digit number, all of whose digits are in non-decreasing order, coincides in at least one digit with at least one of the numbers $N_1$, $...$ , $N_k$. Find the smallest possible value of $k$.

The triangle $K_2$ has as its vertices the feet of the altitudes of a non-right triangle $K_1$. Find all possibilities for the sizes of the angles of $K_1$ for which the triangles $K_1$ and $K_2$ are similar.

A $10\times 10\times 10$ grid of points consists of all points in space of the form $(i,j,k)$, where $i$, $j$, and $k$ are integers between $1$ and $10$, inclusive. Find the number of different lines that contain exactly $8$ of these points.

In a $m\times n$ chessboard ($m,n\ge 2$), some dominoes are placed (without overlap) with each domino covering exactly two adjacent cells. Show that if no more dominoes can be added to the grid, then at least $2/3$ of the chessboard is covered by dominoes. [i]Proposed by DVDthe1st, mzy and jjax[/i]

Given that $x$, $y$, and $z$ are real numbers that satisfy: \[ x=\sqrt{y^2-\frac{1}{16}}+\sqrt{z^2-\frac{1}{16}} \] \[ y=\sqrt{z^2-\frac{1}{25}}+\sqrt{x^2-\frac{1}{25}} \] \[ z=\sqrt{x^2-\frac{1}{36}}+\sqrt{y^2-\frac{1}{36}} \] and that $x+y+z=\frac{m}{\sqrt{n}}$, where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime, find $m+n$.

If $a$ is any number, $\lfloor a \rfloor$ is $a$ rounded down to the nearest integer. For example, $\lfloor \pi \rfloor =$ $3$. Show that the sequence $\lfloor \frac{2^{1}}{17} \rfloor$, $\lfloor \frac{2^{2}}{17} \rfloor$, $\lfloor \frac{2^{3}}{17} \rfloor$, $\dots$ contains infinitely many odd numbers.