The accuracy of a mystic's prediction is related to the volume of his or her crystal ball by the equation $P = 1 - (0.999)^V$, where $P$ is the probability the mystic's prediction is correct and $V$ is the volume of his ball in cubic centimeters. These crystal balls are sold wth radii that are a whole number of centimeters. What is the radius (in centimeters) of the smallest ball that gives the mystic over a $99\%$ chance to make an accurate prediction.

Find all $f$ functions from real numbers to itself such that for all real numbers $x,y$ the equation \[f(f(y)+x^2+1)+2x=y+(f(x+1))^2\] holds.

Point $O$ is a center of circumcircle of acute triangle $ABC$, bisector of angle $BAC$ cuts side $BC$ in point $D$. Let $M$ be a point such that, $MC \perp BC$ and $MA \perp AD$. Lines $BM$ and $OA$ intersect in point $P$. Show that circle of center in point $P$ passing through a point $A$ is tangent to line $BC$.

Let $ABC$ be acute-angled triangle . A circle $\omega_1(O_1,R_1)$ passes through points $B$ and $C$ and meets the sides $AB$ and $AC$ at points $D$ and $E$ ,respectively . Let $\omega_2(O_2,R_2)$ be the circumcircle of triangle $ADE$ . Prove that $O_1O_2$ is equal to the circumradius of triangle $ABC$ .

Let $a, b, c$ be non zero integers,$ a\ne c$ such that $$\frac{a}{c}=\frac{a^2+b^2}{c^2+b^2}$$ Prove that $a^2 +b^2 +c^2$ cannot be a prime number.

sppose that $\sigma_k:\mathbb N \longrightarrow \mathbb R$ is a function such that $\sigma_k(n)=\sum_{d|n}d^k$. $\rho_k:\mathbb N \longrightarrow \mathbb R$ is a function such that $\rho_k\ast \sigma_k=\delta$. find a formula for $\rho_k$.($\frac{100}{6}$ points)

Call a positive integer "useful but not optimized " (!), if it can be written as a sum of distinct powers of $3$ and powers of $5$. Prove that there exist infinitely many positive integers which they are not "useful but not optimized". (e.g. $37=(3^0+3^1+3^3)+(5^0+5^1)$ is a " useful but not optimized" number) [i]Proposed by Mohsen Jamali[/i]

Let $BM$ be a median in an acute-angled triangle $ABC$. A point $K$ is chosen on the line through $C$ tangent to the circumcircle of $\vartriangle BMC$ so that $\angle KBC = 90^\circ$. The segments $AK$ and $BM$ meet at $J$. Prove that the circumcenter of $\triangle BJK$ lies on the line $AC$. Aleksandr Kuznetsov, Russia

The sequence of natural numbers is defined as follows: for any $ k\geq 1 $,$ a_{k+2}= a_{k+1}\cdot a_k+1 $. Prove that for $ k\geq 9 $ the number $ a_k-22 $ is composite.

Let $S=\{1,2,\ldots,10\}$. Three numbers are chosen with replacement from $S$. If the chosen numbers denote the lengths of sides of a triangle, then the probability that they will form a triangle is: $\textbf{(A)}~\frac{101}{200}$ $\textbf{(B)}~\frac{99}{200}$ $\textbf{(C)}~\frac12$ $\textbf{(D)}~\frac{110}{200}$

The points $S(i, j)$ with integer Cartesian coordinates $0 < i \leq n, 0 < j \leq m, m \leq n$, form a lattice. Find the number of: [b](a)[/b] rectangles with vertices on the lattice and sides parallel to the coordinate axes; [b](b)[/b] squares with vertices on the lattice and sides parallel to the coordinate axes; [b](c)[/b] squares in total, with vertices on the lattice.

Let $N\geq 2$ be a natural number. At a mathematical olympiad training camp the same $N$ courses are organised every day. Each student takes exactly one of the $N$ courses each day. At the end of the camp, every student has takes each course exactly once, and any two students took the same course on at least one day, but took different courses on at least one other day. What is, in terms of $N$, the largest possible number of students at the camp?

Hermione and Ron play a game that starts with $129$ hats arranged in a circle. They take turns magically transforming the hats into animals. On each turn, a player picks a hat and chooses whether to change it into a badger or into a raven. A player loses if after his or her turn there are two animals of the same species right next to each other. Hermione goes first. Who loses?

Let $ABCD$ be a rectangle. The point $E$ lies on side $ \overline{AB}$ and the point $F$ is lies side $ \overline{AD}$, such that $\angle FEC=\angle CEB$ and $\angle DFC=\angle CFE$. Determine the measure of the angle $\angle FCE$ and the ratio $AD/AB$.

Let $a,b,c,d$ be integers such that the number $a-b+c-d$ is odd and it divides the number $a^2-b^2+c^2-d^2$. Show that, for every positive integer $n$, $a-b+c-d$ divides $a^n-b^n+c^n-d^n$.

There is a row with $2024$ cells. Ana and Beto take turns playing, with Ana going first. On each turn, the player selects an empty cell and places a digit in that space. Once all $2024$ cells are filled, the number obtained from reading left to right is considered, ignoring any leading zeros. Beto wins if the resulting number is a multiple of $99$, otherwise Ana wins. Determine which of the two players has a winning strategy and describe it.

[b]p1.[/b] The edges of a tetrahedron are all tangent to a sphere. Prove that the sum of the lengths of any pair of opposite edges equals the sum of the lengths of any other pair of opposite edges. (Two edges of a tetrahedron are said to be opposite if they do not have a vertex in common.) [b]p2.[/b] Find the simplest formula possible for the product of the following $2n - 2$ factors: $$\left(1+\frac12 \right),\left(1-\frac12 \right), \left(1+\frac13 \right) , \left(1-\frac13 \right),...,\left(1+\frac{1}{n} \right), \left(1-\frac{1}{n} \right)$$. Prove that your formula is correct. [b]p3.[/b] Solve $$\frac{(x + 1)^2+1}{x + 1} + \frac{(x + 4)^2+4}{x + 4}=\frac{(x + 2)^2+2}{x + 2}+\frac{(x + 3)^2+3}{x + 3}$$ [b]p4.[/b] Triangle $ABC$ is inscribed in a circle, $BD$ is tangent to this circle and $CD$ is perpendicular to $BD$. $BH$ is the altitude from $B$ to $AC$. Prove that the line $DH$ is parallel to $AB$. [img]https://cdn.artofproblemsolving.com/attachments/e/9/4d0b136dca4a9b68104f00300951837adef84c.png[/img] [b]p5.[/b] Consider the picture below as a section of a city street map. There are several paths from $A$ to $B$, and if one always walks along the street, the shortest paths are $15$ blocks in length. Find the number of paths of this length between $A$ and $B$. [img]https://cdn.artofproblemsolving.com/attachments/8/d/60c426ea71db98775399cfa5ea80e94d2ea9d2.png[/img] [b]p6.[/b] A [u]finite [/u] [u]graph [/u] is a set of points, called [u]vertices[/u], together with a set of arcs, called [u]edges[/u]. Each edge connects two of the vertices (it is not necessary that every pair of vertices be connected by an edge). The [u]order [/u] of a vertex in a finite graph is the number of edges attached to that vertex. [u]Example[/u] The figure at the right is a finite graph with $4$ vertices and $7$ edges. [img]https://cdn.artofproblemsolving.com/attachments/5/9/84d479c5dbd0a6f61a66970e46ab15830d8fba.png[/img] One vertex has order $5$ and the other vertices order $3$. Define a finite graph to be [u]heterogeneous [/u] if no two vertices have the same order. Prove that no graph with two or more vertices is heterogeneous. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A rabbit initially stands at the position $0$, and repeatedly jumps on the real line. In each jump, the rabbit can jump to any position corresponds to an integer but it cannot stand still. Let $N(a)$ be the number of ways to jump with a total distance of $2019$ and stop at the position $a$. Determine all integers $a$ such that $N(a)$ is odd.

Show that the recursion $n=x_n(x_{n-1}+x_n+x_{n+1})$, $n=1,2,\ldots$, $x_0=0$ has exaclty one nonnegative solution. (translated by L. Erdős)

A sequence $(a_n)_{n\ge0}$ satisfies $a_{m+n}+a_{m-n}=\frac12\left(a_{2m}+a_{2n}\right)$ for all integers $m,n$ with $m\ge n\ge0$. Given that $a_1=1$, find $a_{2003}$.

Does there exist a function $f: \mathbb R \to \mathbb R $ satisfying the following conditions: (i) for each real $y$ there is a real $x$ such that $f(x)=y$ , and (ii) $f(f(x)) = (x - 1)f(x) + 2$ for all real $x$ ? [i]Proposed by Igor I. Voronovich, Belarus[/i]

Define a sequence $\{a_n\}_{n \geq 1}$ recursively by $a_1=1$, $a_2=2$, and for all integers $n \geq 2$, $a_{n+1}=(n+1)^{a_n}$. Determine the number of integers $k$ between $2$ and $2020$, inclusive, such that $k+1$ divides $a_k - 1$. [i]Proposed by Taiki Aiba[/i]

Is it possible to divide $5$ apples of the same size equally between six children so that no apple will be cut into more than $3$ pieces? (You are allowed to cut an apple into any number of equal pieces).

Together, the two positive integers $a$ and $b$ have $9$ digits and contain each of the digits $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly once. For which possible values of $a$ and $b$ is the fraction $a/b$ closest to $1$?

$m$ boys and $n$ girls ($m>n$) sat across a round table, supervised by a teacher, and they did a game, which went like this. At first, the teacher pointed a boy to start the game. The chosen boy put a coin on the table. Then, consecutively in a clockwise order, everyone did his turn. If the next person is a boy, he will put a coin to the existing pile of coins. If the next person is a girl, she will take a coin from the existing pile of coins. If there is no coin on the table, the game ends. Notice that depending on the chosen boy, the game could end early, or it could go for a full turn. If the teacher wants the game to go for at least a full turn, how many possible boys could be chosen? [i]Hendrata Dharmawan, Boston, USA[/i]