Let $\mathbb N$ be the set of all positive integers. A subset $A$ of $\mathbb N$ is [i]sum-free[/i] if, whenever $x$ and $y$ are (not necessarily distinct) members of $A$, their sum $x+y$ does not belong to $A$. Determine all surjective functions $f:\mathbb N\to\mathbb N$ such that, for each sum-free subset $A$ of $\mathbb N$, the image $\{f(a):a\in A\}$ is also sum-free. [i]Note: a function $f:\mathbb N\to\mathbb N$ is surjective if, for every positive integer $n$, there exists a positive integer $m$ such that $f(m)=n$.[/i]

Calculate with at most $10\%$ relative error \[\int_{-\infty}^{\infty}(x^4+4x+4)^{-100}dx\]

Let $A$ be a $n\times n$ matrix such that $A_{ij} = i+j$. Find the rank of $A$. [hide="Remark"]Not asked in the contest: $A$ is diagonalisable since real symetric matrix it is not difficult to find its eigenvalues.[/hide]

Mark $4 \cdot k$ points in a circle and number them arbitrarily with numbers from $1$ to $4 \cdot k$. The chords cannot share common endpoints, also, the endpoints of these chords should be among the $4 \cdot k$ points. [b]i.[/b] Prove that $2 \cdot k$ pairwisely non-intersecting chords can be drawn for each of whom its endpoints differ in at most $3 \cdot k - 1$. [b]ii.[/b] Prove that the $3 \cdot k - 1$ cannot be improved.

Let $C_1$ and $C_2$ be two concentric circles in the plane with radii $R$ and $3R$ respectively. Show that the orthocenter of any triangle inscribed in circle $C_1$ lies in the interior of circle $C_2$. Conversely, show that every point in the interior of $C_2$ is the orthocenter of some triangle inscribed in $C_1$.

Let $ABCD $ be cyclic quadrilateral with circumcircle $\omega $ and $M $ be any point on $\omega $.\\ Let $E $ and $F $ be the intersection of $AB,CD $ and $AD,BC $ respectively.\\ $ME $ intersects lines $AD,BC $ at $P,Q $ and similarly $MF$ intersects lines $AB,CD $ at $R,S $.\\ Let the lines $PS $ and $RQ $ meet at $X $.\\ Prove that as $M $ varies over $\omega $\\ $MX $ passes through fixed point.\\ [i]Proposed by Mehdi Etesami Fard [/i]

Find the smallest positive integer solution to $\tan 19x^\circ=\frac{\cos 96^\circ+\sin 96^\circ}{\cos 96^\circ-\sin 96^\circ}.$

If ellipse $x^2+4(y-a)^2=4$ and parabola $x^2=2y$ have intersections, then the range value of $a$ is________.

Prove that for any reals $a> b> c$, the inequality $a^2(b - c) + b^2(c - a) + c^2(a - b)> 0$.

Evaluate $2000^3-1999\cdot 2000^2-1999^2\cdot 2000+1999^3$

For a natural number $n$, let $D (n)$ be the set of (positive integers) divisors of $n$. Furthermore let $d (n)$ be the number of divisors of $n,$ that is, the cardinality of $D (n)$. For each such $n$, prove the equality $$\sum_{k\in D(n)} d(k)^3=\left( \sum_{k\in D(n)} d(k)\right) ^2.$$

Consider a regular polygon with 2007 vertices. The natural numbers $ 1,2, \ldots, 4014$ shall be distributed across the vertices and edge midpoints such that for each side the sum of its three numbers (two end points, one side center) has the same value. Show that such an assignment is possible.

Two ants are moving along the edges of a convex polyhedron. The route of every ant ends in its starting point, so that one ant does not pass through the same point twice along its way. On every face $F$ of the polyhedron are written the number of edges of $F$ belonging to the route of the first ant and the number of edges of $F$ belonging to the route of the second ant. Is there a polyhedron and a pair of routes described as above, such that only one face contains a pair of distinct numbers? [i]Proposed by Nikolai Beluhov[/i]

Let $ABC$ be a triangle in which (${BL}$is the angle bisector of ${\angle{ABC}}$ $\left( L\in AC \right)$, ${AH}$ is an altitude of$\vartriangle ABC$ $\left( H\in BC \right)$ and ${M}$is the midpoint of the side ${AB}$. It is known that the midpoints of the segments ${BL}$ and ${MH}$ coincides. Determine the internal angles of triangle $\vartriangle ABC$.

Show that for any positive real numbers $a$ and $b$ the following inequality hold, $$\frac{a(a+1)}{b+1}+\frac{b(b+1)}{a+1}\geq a+b.$$

The sum of the largest number and the smallest number of a triple of positive integers $(x,y,z)$ is called to be the power of the triple. What is the sum of powers of all triples $(x,y,z)$ where $x,y,z \leq 9$? $ \textbf{(A)}\ 9000 \qquad\textbf{(B)}\ 8460 \qquad\textbf{(C)}\ 7290 \qquad\textbf{(D)}\ 6150 \qquad\textbf{(E)}\ 6000 $

Let $ABC$ be an acute triangle and $AD$ a height. The angle bissector of $\angle DAC$ intersects $DC$ at $E$. Let $F$ be a point on $AE$ such that $BF$ is perpendicular to $AE$. If $\angle BAE=45º$, find $\angle BFC$.

Malcolm writes a positive integer on a piece of paper. Malcolm doubles this integer and subtracts 1, writing this second result on the same piece of paper. Malcolm then doubles the second integer and adds 1, writing this third integer on the paper. If all of the numbers Malcolm writes down are prime, determine all possible values for the first integer.

$F_n$ is the Fibonacci sequence $F_0 = F_1 = 1$, $F_{n+2} = F_{n+1} + F_n$. Find all pairs $m > k \geq 0$ such that the sequence $x_0, x_1, x_2, ...$ defined by $x_0 = \frac{F_k}{F_m}$ and $x_{n+1} = \frac{2x_n - 1}{1 - x_n}$ for $x_n \not = 1$, or $1$ if $x_n = 1$, contains the number $1$

Find all continuous functions $f: R \to R$ such that for all reals $x$ and $y$, $f(x+f(y)) = y+f(x+1)$.

[u]Round 1[/u] [b]p1.[/b] At a fortune-telling exam, $13$ witches are sitting in a circle. To pass the exam, a witch must correctly predict, for everybody except herself and her two neighbors, whether they will pass or fail. Each witch predicts that each of the $10$ witches she is asked about will fail. How many witches could pass? [b]p2.[/b] Out of $152$ coins, $7$ are counterfeit. All counterfeit coins have the same weight, and all real coins have the same weight, but counterfeit coins are lighter than real coins. How can you find $19$ real coins if you are allowed to use a balance scale three times? [b]p3.[/b] The digits of a number $N$ increase from left to right. What could the sum of the digits of $9 \times N$ be? [b]p4.[/b] The sides and diagonals of a pentagon are colored either blue or red. You can choose three vertices and flip the colors of all three lines that join them. Can every possible coloring be turned all blue by a sequence of such moves? [img]https://cdn.artofproblemsolving.com/attachments/5/a/644aa7dd995681fc1c813b41269f904283997b.png[/img] [b]p5.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake and call that number $N$. Pick up the stack of the top $N$ pancakes and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [u]Round 2[/u] [b]p6.[/b] A circus owner will arrange $100$ fleas on a long string of beads, each flea on her own bead. Once arranged, the fleas start jumping using the following rules. Every second, each flea chooses the closest bead occupied by one or more of the other fleas, and then all fleas jump simultaneously to their chosen beads. If there are two places where a flea could jump, she jumps to the right. At the start, the circus owner arranged the fleas so that, after some time, they all gather on just two beads. What is the shortest amount of time it could take for this to happen? [b]p7.[/b] The faraway land of Noetheria has $2016$ cities. There is a nonstop flight between every pair of cities. The price of a nonstop ticket is the same in both directions, but flights between different pairs of cities have different prices. Prove that you can plan a route of $2015$ consecutive flights so that each flight is cheaper than the previous one. It is permissible to visit the same city several times along the way. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all functions $ f: \mathbb{N}_0 \rightarrow \mathbb{N}_0$ such that $ f(f(n))\plus{}f(n)\equal{}2n\plus{}6$ for all $ n \in \mathbb{N}_0$.

For the various values of the parameter $a \in R$, solve the equation $ ||x - 4| - 2x + 8| = ax + 4$

Find all polynomials $P(x)$ with integral coefficients whose values at points $x = 1, 2, . . . , 2021$ are numbers $1, 2, . . . , 2021$ in some order.

Let $ABCD$ be a square. The points $N$ and $P$ are chosen on the sides $AB$ and $AD$ respectively, such that $NP=NC$. The point $Q$ on the segment $AN$ is such that that $\angle QPN=\angle NCB$. Prove that $\angle BCQ=\frac{1}{2}\angle AQP$.