Let $\mathbb{N}$ be the set of positive integers. A function $f:\mathbb{N}\to\mathbb{N}$ satisfies the equation \[\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(n)\ldots))=\frac{n^2}{f(f(n))}\] for all positive integers $n$. Given this information, determine all possible values of $f(1000)$. [i]Proposed by Evan Chen[/i]

Two ducks, Wat and Q, are taking a math test with $1022$ other ducklings. The test has $30$ questions, and the $n$th question is worth $n$ points. The ducks work independently on the test. Wat gets the $n$th problem correct with probability $\frac{1}{n^2}$ while Q gets the $n$th problem correct with probability $\frac{1}{n+1}$. Unfortunately, the remaining ducklings each answer all $30$ questions incorrectly. Just before turning in their test, the ducks and ducklings decide to share answers! On any question which Wat and Q have the same answer, the ducklings change their answers to agree with them. After this process, what is the expected value of the sum of all $1024$ scores? [i]Proposed by Evan Chen[/i]

Suppose that zeros and ones are written in the cells of an $n\times n$ board, in such a way that the four cells in the intersection of any two rows and any two columns contain at least one zero. Prove that the number of ones does not exceed $\frac n2\left(1+\sqrt{4n-3}\right)$.

Seven points are selected randomly from $ S^1\subset\mathbb C$. What is the probability that origin is not contained in convex hull of these points?

$\boxed{\text{A5}}$ Determine all positive integers $a,b$ such that $a^{2}b^{2}+208=4([a,b]+(a,b))^2$ where $[a,b]$-lcm of $a,b$ and $(a,b)$-gcd of $a,b$.

Find the number of subsets of $\{1, 2, \cdots, 2000 \}$, the sum of whose elements is divisible by $5$.

Fridolin the frog jumps on the number line: He starts at $0$, then jumps in some order on each of the numbers $1,2,\dots,9$ exactly once and finally returns with his last jump to $0$. Can the total distance he travelled with these $10$ jumps be a) $20$, b) $25$?

For all $x,y,z$ positive real numbers, find the all $c$ positive real numbers that providing $$\frac{x^3y+y^3z+z^3x}{x+y+z}+\frac{4c}{xyz}\ge2c+2$$

There are $1999$ balls in a row, some are red and some are blue (it could be all red or all blue). Under every ball we write a number equal to the sum of the amount of red balls in the right of this ball plus the sum of the amount of the blue balls that are in the left of this ball. In the sequence of numbers that we get with this balls we have exactly three numbers that appears an odd number of times, which numbers could these three be?

(a) Three lines $l,m,n$ in space pass through point $S$. A plane perpendicular to $m$ intersects $l,m,n $ at $A,B,C$ respectively. Suppose that $\angle ASB = \angle BSC = 45^o$ and $\angle ABC = 90^o$. Compute $\angle ASC$. (b) Furthermore, if a plane perpendicular to $l$ intersects $l,m,n$ at $P,Q,R$ respectively and $SP = 1$, find the sides of triangle $PQR$.

A square with sides of length $6$ has the same area as a rectangle with a length of $9$. What is the width of the rectangle? $\textbf{(A) } 2\qquad\textbf{(B) } \frac73\qquad\textbf{(C) } 3\qquad\textbf{(D) } \frac{10}{3}\qquad\textbf{(E) } 4$

Show that the equation $x^7 + y^7 = {1998}^z$ has no solution in positive integers.

For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$

In a certain language words are formed using an alphabet of three letters. Some words of two or more letters are not allowed, and any two such distinct words are of different lengths. Prove that one can form a word of arbitrary length that does not contain any non-allowed word.

Let $(a_1,a_2, \dots ,a_{10})$ be a list of the first $10$ positive integers such that for each $2 \le i \le 10$ either $a_i+1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there? $ \textbf{(A)}\ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ 362,880 $

Let $a$ and $b$ be the roots of the equation $x^2-47x+289=0$. Compute $\sqrt{a}+\sqrt{b}$.

A quadrilateral $ABCD$ is inscribed in a circle $(O)$. Another circle $(I)$ is tangent to the diagonals $AC, BD$ at $M, N$ respectively. Suppose that $MN$ meets $AB,CD$ at $P, Q$ respectively. The circumcircle of triangle $IMN$ meets the circumcircles of $IAB, ICD$ at $K, L$ respectively, which are distinct from $I$. Prove that the lines $PK, QL$, and $OI$ are concurrent. Tran Minh Ngoc, a student of Ho Chi Minh City College, Ho Chi Minh

Let $2001$ given points on a circle be coloured either red or green. In one step all points are recoloured simultaneously in the following way: If both direct neighbours of a point $P$ have the same colour as $P$, then the colour of $P$ remains unchanged, otherwise $P$ obtains the other colour. Starting with the first colouring $F_1$, we obtain the colourings $F_2,F_3 ,\ldots .$ after several recolouring steps. Prove that there is a number $n_0\le 1000$ such that $F_{n_0}=F_{n_0 +2}$. Is the assertion also true if $1000$ is replaced by $999$?

Sarika, Dev, and Rajiv are sharing a large block of cheese. They take turns cutting off half of what remains and eating it: first Sarika eats half of the cheese, then Dev eats half of the remaining half, then Rajiv eats half of what remains, then back to Sarika, and so on. They stop when the cheese is too small to see. About what fraction of the original block of cheese does Sarika eat in total? $\hspace*{5mm}\text{(A) } \frac{4}{7} \quad \text{(B) } \frac{3}{5} \quad \text{(C) } \frac{2}{3} \quad \text{(D) } \frac{3}{4} \quad \text{(E) } \frac{7}{8}$

Let $x, y, z$ be positive real numbers whose sum is $2012$. Find the maximum value of $$ \frac{(x^2 + y^2 + z^2)(x^3 + y^3 + z^3)}{(x^4 + y^4 + z^4)}$$

Let $f(x)=x^5-3x^4+2x^3+6x^2+x-14=a(x-1)^5+b(x-1)^4+c(x-1)^3+d(x-1)^2+e(x-1)+f,$ for some real constants $a,b,c,d,e,f.$ Determine the value of $ab+bc+cd+de+ad+be.$

Alma and Bertha play the following game. There are $100$ round, $200$ triangular and $200$ square pieces on a table. In each move a player must remove two pieces, but it cannot be a triangle and a square. Alma starts, and one loses if one is unable to move or if there are no pieces left when it is one’s turn. Which player has a winning strategy?

Determine all ten-digit numbers whose decimal $\overline{a_0a_1a_2a_3a_4a_5a_6a_7a_8a_9}$ is given by such that for each integer $j$ with $0\le j \le 9, a_j$ is equal to the number of digits equal to $j$ in this representation. That is: the first digit is equal to the amount of "$0$" in the writing of that number, the second digit is equal to the amount of "$1$" in the writing of that number, the third digit is equal to the amount of "$2$" in the writing of that number, ... , the tenth digit is equal to the number of "$9$" in the writing of that number.

$N$ integers are given. Prove that the sum of their squares is divisible by $N$ if it is known that the difference between the product of any $N - 1$ of them and the last one is divisible by $N$. (D. Fomin, Leningrad)

In the square of an integer $ a$, the tens’ digit is $7$. What is the units’ digit of $a^2$?