In [i]Terra Brasilis[/i] there are $n$ houses where $n$ goblins live, each in a house. There are one-way routes such that: - each route joins two houses, - in each house exactly one route begins, - in each house exactly one route ends. If a route goes from house $A$ to house $B$, then we will say that house $B$ is next to house $A$. This relationship is not symmetric, that is: in this situation, not necessarily house $A$ is next to house $B$. Every day, from day $1$, each goblin leaves the house where he is and arrives at the next house. A legend of [i]Terra Brasilis[/i] says that when all the goblins return to the original position, the world will end. a) Show that the world will end. b) If $n = 98$, show that it is possible for elves to build and guide the routes so that the world does not end before $300,000$ years.

Prove that there are two numbers $u$ and $v$, between any $101$ real numbers that apply $100 |u - v| \cdot |1 - uv| \le (1 + u^2)(1 + v^2)$

Determine all functions $f:\mathbb R\rightarrow\mathbb R$ satisfying the condition \[f(y^2+2xf(y)+f(x)^2)=(y+f(x))(x+f(y))\] for all real numbers $x$ and $y$.

Find all positive real numbers $c$ such that there are infinitely many pairs of positive integers $(n,m)$ satisfying the following conditions: $n \ge m+c\sqrt{m - 1}+1$ and among numbers $n. n+1,.... 2n-m$ there is no square of an integer. (Slovakia)

The positive numbers $a, b, c$ are such that $a^2<16bc, b^2<16ca$ and $c^2<16ab$. Prove that \[a^2+b^2+c^2<2(ab+bc+ca).\]

Let $ABCD$ be a convex quadrilateral, such that $AB = CD$, $\angle BCD = 2 \angle BAD$, $\angle ABC = 2 \angle ADC$ and $\angle BAD \neq \angle ADC$. Determine the measure of the angle between the diagonals $AC$ and $BD$.

The ratio of $3$ to the positive number $n$ is the same as the ratio of $n$ to $192.$ Find $n.$

[b]Problem Section #1 c) Find all pairs $(m, n)$ of non-negative integers for which $m^2+2.3^n=m(2^{n+1}-1).$

Consider a multiplicative function \( f \) from the positive integers to the unit disk centered at the origin, that is, \( f : \mathbb{Z}^+ \to D^2 \subseteq \mathbb{C} \) such that \( f(mn) = f(m)f(n) \). Prove that for every \( \epsilon > 0 \) and every integer \( k > 0 \), there exist \( k \) distinct positive integers \( a_1, a_2, \dots, a_k \) such that \( \text{gcd}(a_1, a_2, \dots, a_k) = k \) and \( d(f(a_i), f(a_j)) < \epsilon \) for all \( i, j = 1, \dots, k \).

Given a rectangle $ABCD$ with $AB = a$ and $BC = b$. Point $O$ is the intersection of the two diagonals. Extend the side of the $BA$ so that $AE = AO$, also extend the diagonal of $BD$ so that $BZ = BO.$ Assume that triangle $EZC$ is equilateral. Prove that (i) $b = a\sqrt3$ (ii) $EO$ is perpendicular to $ZD$

Let $S$ be a nonempty set of points of the plane. We say that $S$ determines the distance $d > 0$ if there are two points $A, B$ in $S$ such that $AB = d$. Assuming that $S$ does not contain $8$ collinear points and that it determines not more than $91$ distances, prove that $S$ has less than $2004$ elements.

After school, Maya and Naomi headed to the beach, $6$ miles away. Maya decided to bike while Naomi took a bus. The graph below shows their journeys, indicating the time and distance traveled. What was the difference, in miles per hour, between Naomi's and Maya's average speeds? [asy] unitsize(1.25cm); dotfactor = 10; pen shortdashed=linetype(new real[] {2.7,2.7}); for (int i = 0; i < 6; ++i) { for (int j = 0; j < 6; ++j) { draw((i,0)--(i,6), grey); draw((0,j)--(6,j), grey); } } for (int i = 1; i <= 6; ++i) { draw((-0.1,i)--(0.1,i),linewidth(1.25)); draw((i,-0.1)--(i,0.1),linewidth(1.25)); label(string(5*i), (i,0), 2*S); label(string(i), (0, i), 2*W); } draw((0,0)--(0,6)--(6,6)--(6,0)--(0,0)--cycle,linewidth(1.25)); label(rotate(90) * "Distance (miles)", (-0.5,3), W); label("Time (minutes)", (3,-0.5), S); dot("Naomi", (2,6), 3*dir(305)); dot((6,6)); label("Maya", (4.45,3.5)); draw((0,0)--(1.15,1.3)--(1.55,1.3)--(3.15,3.2)--(3.65,3.2)--(5.2,5.2)--(5.4,5.2)--(6,6),linewidth(1.35)); draw((0,0)--(0.4,0.1)--(1.15,3.7)--(1.6,3.7)--(2,6),linewidth(1.35)+shortdashed); [/asy] $\textbf{(A) }6 \qquad \textbf{(B) }12 \qquad \textbf{(C) }18 \qquad \textbf{(D) }20 \qquad \textbf{(E) }24$

Find all strictly increasing functions $f : Z \to R$ such that for any $m, n \in Z$ there exists a $k \in Z$ such that $f(k) = f(m) - f(n)$. Nguyễn Duy Thái Sơn

Let $G$ be the centroid of triangle $ABC$. Through $G$ draw a line parallel to $BC$ and intersecting the sides $AB$ and $AC$ at $P$ and $Q$ respectively. Let $BQ$ intersect $GC$ at $E$ and $CP$ intersect $GB$ at $F$. If $D$ is midpoint of $BC$, prove that triangles $ABC$ and $DEF$ are similar

Find, with proof, all pairs of positive integers $(n,d)$ with the following property: for every integer $S$, there exists a unique non-decreasing sequence of $n$ integers $a_1,a_2,...,a_n$ such that $a_1 + a_2 + ... + a_n = S$ and $a_n-a_1=d.$

For each positive integer $n$, let $a(n)$ be the number of zeroes in the base 3 representation of $n$. For which positive real numbers $x$ does the series\[ \sum_{n=1}^\infty \frac{x^{a(n)}}{n^3} \]converge?

Determine all positive integers $n$ such that $2022 + 3^n$ is a perfect square.

Find the least number which is divisible by 2009 and its sum of digits is 2009.

For positive reals $p$ and $q$, define the [i]remainder[/i] when $p$ and $q$ as the smallest nonnegative real $r$ such that $\tfrac{p-r}{q}$ is an integer. For an ordered pair $(a, b)$ of positive integers, let $r_1$ and $r_2$ be the remainder when $a\sqrt{2} + b\sqrt{3}$ is divided by $\sqrt{2}$ and $\sqrt{3}$ respectively. Find the number of pairs $(a, b)$ such that $a, b \le 20$ and $r_1 + r_2 = \sqrt{2}$.

Bisector of angle $BAC$ of triangle $ABC$ intersects circumcircle of this triangle in point $D \neq A$. Points $K$ and $L$ are orthogonal projections on line $AD$ of points $B$ and $C$, respectively. Prove that $AD \ge BK + CL$.

In a certain base $b$ (different from $10$), $57_b^2=2721_b$. What is $17_b^2$ in this base? $\text{(A) }201_b\qquad\text{(B) }261_b\qquad\text{(C) }281_b\qquad\text{(D) }289_b\qquad\text{(E) }341_b$

There are are $n$ children and $n$ toys such that each child has a strict preference ordering on the toys. We want to distribute the toys: say a distribution $A$ dominates a distribution $ B \ne A $ if in $A$, each child receives at least as preferable of a toy as in $B$. Prove that if some distribution is not dominated by any other, then at least one child gets his/her favorite toy in that distribution.

Find all polynomials $P(x)$ with real coefficients that satisfy \[P(x\sqrt{2})=P(x+\sqrt{1-x^2})\]for all real $x$ with $|x|\le 1$.

Answer the following questions : $\textbf{(a)}$ Find all real solutions of the equation $$\Big(x^2-2x\Big)^{x^2+x-6}=1$$ Explain why your solutions are the only solutions. $\textbf{(b)}$ The following expression is a rational number. Find its value. $$\sqrt[3]{6\sqrt{3}+10} -\sqrt[3]{6\sqrt{3}-10}$$

Determine all totally multiplicative and non-negative functions $f\colon\mathbb{Z}\rightarrow \mathbb{Z}$ with the property that if $a, b\in \mathbb{Z}$ and $b\neq 0$, then there exist integers $q$ and $r$ such that $a-qb+r$ and $f(r)<f(b)$.