2011 Indonesia TST

Stage 2

Day 1

1

Find all $4$-tuple of real numbers $(x, y, z, w)$ that satisfy the following system of equations: $$x^2 + y^2 + z^2 + w^2 = 4$$$$\frac{1}{x^2} +\frac{1}{y^2} +\frac{1}{z^2 }+\frac{1}{w^2} = 5 -\frac{1}{(xyzw)^2}$$

2

At a certain mathematical conference, every pair of mathematicians are either friends or strangers. At mealtime, every participant eats in one of two large dining rooms. Each mathematician insists upon eating in a room which contains an even number of his or her friends. Prove that the number of ways that the mathematicians may be split between the two rooms is a power of two (i.e., is of the form $ 2^k$ for some positive integer $ k$).

3

Let $M$ be a point in the interior of triangle $ABC$. Let $A'$ lie on $BC$ with $MA'$ perpendicular to $BC$. Define $B'$ on $CA$ and $C'$ on $AB$ similarly. Define \[ p(M) = \frac{MA' \cdot MB' \cdot MC'}{MA \cdot MB \cdot MC}. \] Determine, with proof, the location of $M$ such that $p(M)$ is maximal. Let $\mu(ABC)$ denote this maximum value. For which triangles $ABC$ is the value of $\mu(ABC)$ maximal?

4

Let $a, b$, and $c$ be positive integers such that $gcd(a, b) = 1$. Sequence $\{u_k\}$, is given such that $u_0 = 0$, $u_1 = 1$, and u$_{k+2} = au_{k+1} + bu_k$ for all $k \ge 0$. Let $m$ be the least positive integer such that $c | u_m$ and $n$ be an arbitrary positive integer such that $c | u_n$. Show that $m | n$. PS.There was a typo in the last line, as it didn't define what n does. Wording comes from tst-2011-1.pdf from here. Correction was made according to #2

Day 2

1

For all positive integer $n$, define $f_n(x)$ such that $f_n(x) = \sum_{k=1}^n{|x - k|}$. Determine all solution from the inequality $f_n(x) < 41$ for all positive $2$-digit integers $n$ (in decimal notation).

2

Find the limit, when $n$ tends to the infinity, of $$\frac{\sum_{k=0}^{n} {{2n} \choose {2k}} 3^k} {\sum_{k=0}^{n-1} {{2n} \choose {2k+1}} 3^k}$$

3

Circle $\omega$ is inscribed in quadrilateral $ABCD$ such that $AB$ and $CD$ are not parallel and intersect at point $O.$ Circle $\omega_1$ touches the side $BC$ at $K$ and touches line $AB$ and $CD$ at points which are located outside quadrilateral $ABCD;$ circle $\omega_2$ touches side $AD$ at $L$ and touches line $AB$ and $CD$ at points which are located outside quadrilateral $ABCD.$ If $O,K,$ and $L$ are collinear$,$ then show that the midpoint of side $BC,AD,$ and the center of circle $\omega$ are also collinear.

4

Prove that there exists infinitely many positive integers $n$ such that $n^2+1$ has a prime divisor greater than $2n+\sqrt{5n+2011}$.

Day 3

1

Let $Q^+$ denote the set of positive rationals. Determine all functions $f : Q^+ \to Q^+$ that satisfy both of these conditions: (i) $f(x)$ is an integer if and only if $x$ is an integer; (ii) $f(f(xf(y)) + x) = yf(x) + x$ for all $x, y \in Q^+$.

2

On a line $\ell$ there exists $3$ points $A, B$, and $C$ where $B$ is located between $A$ and $C$. Let $\Gamma_1, \Gamma_2, \Gamma_3$ be circles with $AC, AB$, and $BC$ as diameter respectively; $BD$ is a segment, perpendicular to $\ell$ with $D$ on $\Gamma_1$. Circles $\Gamma_4, \Gamma_5, \Gamma_6$ and $\Gamma_7$ satisfies the following conditions: $\bullet$ $\Gamma_4$ touches $\Gamma_1, \Gamma_2$, and$ BD$. $\bullet$ $\Gamma_5$ touches $\Gamma_1, \Gamma_3$, and $BD$. $\bullet$ $\Gamma_6$ touches $\Gamma_1$ internally, and touches $\Gamma_2$ and $\Gamma_3$ externally. $\bullet$ $\Gamma_7$ passes through $B$ and the tangent points of $\Gamma_2$ with $\Gamma_6$, and $\Gamma_3$ with $\Gamma_6$. Show that the circles $\Gamma_4, \Gamma_5$, and $\Gamma_7$ are congruent.

3

Given a board consists of $n \times n$ unit squares ($n \ge 3$). Each unit square is colored black and white, resembling a chessboard. In each step, TOMI can choose any $2 \times 2$ square and change the color of every unit square chosen with the other color (white becomes black and black becomes white). Find every $n$ such that after a finite number of moves, every unit square on the board has a same color.

4

Given $N = 2^ap_1p_2...p_m$, $m \ge 1$, $a \in N$ with $p_1, p_2,..., p_m$ are different primes. It is known that $\sigma (N) = 3N $ where $\sigma (N)$ is the sum of all positive integers which are factors of $N$. Show that there exists a prime number $p$ such that $2^p- 1$ is also a prime, and $2^p - 1|N$.

Day 4

1

Find all real number $x$ which could be represented as $x = \frac{a_0}{a_1a_2 . . . a_n} + \frac{a_1}{a_2a_3 . . . a_n} + \frac{a_2}{a_3a_4 . . . a_n} + . . . + \frac{a_{n-2}}{a_{n-1}a_n} + \frac{a_{n-1}}{a_n}$ , with $n, a_1, a_2, . . . . , a_n$ are positive integers and $1 = a_0 \leq a_1 < a_2 < . . . < a_n$

2

Let $n$ be a integer and $n \ge 3$, and $T_1T_2...T_n$ is a regular n-gon. Distinct $3$ points $T_i , T_j , T_k$ are chosen randomly. Determine the probability of triangle $T_iT_jT_k$ being an acute triangle.

3

Let $\Gamma$ is a circle with diameter $AB$. Let $\ell$ be the tangent of $\Gamma$ at $A$, and $m$ be the tangent of $\Gamma$ through $B$. Let $C$ be a point on $\ell$, $C \ne A$, and let $q_1$ and $q_2$ be two lines that passes through $C$. If $q_i$ cuts $\Gamma$ at $D_i$ and $E_i$ ($D_i$ is located between $C$ and $E_i$) for $i = 1, 2$. The lines $AD_1, AD_2, AE_1, AE_2$ intersects $m$ at $M_1, M_2, N_1, N_2$ respectively. Prove that $M_1M_2 = N_1N_2$.

4

A prime number $p$ is a moderate number if for every $2$ positive integers $k > 1$ and $m$, there exists k positive integers $n_1, n_2, ..., n_k $ such that \[ n_1^2+n_2^2+ ... +n_k^2=p^{k+m} \] If $q$ is the smallest moderate number, then determine the smallest prime $r$ which is not moderate and $q < r$.

Day 5

1

Let $a, b, c$ be the sides of a triangle with $abc = 1$. Prove that $$\frac{\sqrt{b + c -a}}{a}+\frac{\sqrt{c + a - b}}{b}+\frac{\sqrt{a + b - c}}{c} \ge a + b + c$$

2

A graph $G$ with $n$ vertex is called good if every vertex could be labelled with distinct positive integers which are less than or equal $\lfloor \frac{n^2}{4} \rfloor$ such that there exists a set of nonnegative integers $D$ with the following property: there exists an edge between $2$ vertices if and only if the difference of their labels is in $D$. Show that there exists a positive integer $N$ such that for every $n \ge N$, there exist a not-good graph with $n$ vertices.

3

Let $ABC$ and $PQR$ be two triangles such that (a) $P$ is the mid-point of $BC$ and $A$ is the midpoint of $QR$. (b) $QR$ bisects $\angle BAC$ and $BC$ bisects $\angle QPR$ Prove that $AB+AC=PQ+PR$.

4

Given an arbitrary prime $p>2011$. Prove that there exist positive integers $a, b, c$ not all divisible by $p$ such that for all positive integers $n$ that $p\mid n^4- 2n^2+ 9$, we have $p\mid 24an^2 + 5bn + 2011c$.