For what values of $k{}$ can a regular octagon with side-length $k{}$ be cut into $1 \times 2{}$ dominoes and rhombuses with side-length 1 and a $45^\circ{}$ angle?
Russian TST 2014
Unavailable - Days 1-6
June 1, 2014 (Group NG) - Day 7
In an acute-angled triangle $ABC$, the point $H{}$ is the orthocenter, $M{}$ is the midpoint of the side $BC$ and $\omega$ is the circumcircle. The lines $AH, BH$ and $CH{}$ intersect $\omega$ a second time at points $D, E$ and $F{}$ respectively. The ray $MH$ intersects $\omega$ at point $J{}$. The points $K{}$ and $L{}$ are the centers of the inscribed circles of the triangles $DEJ$ and $DFJ$ respectively. Prove that $KL\parallel BC$.
Prove that there are infinitely many integers can't be written as $$\frac{p^a-p^b}{p^c-p^d}$$, with a,b,c,d are arbitrary integers and p is an arbitrary prime such that the fraction is an integer too.
June 1, 2014 (Groups A & B) - Day 7
Let $x,y,z$ be positive real numbers. Prove that \[\frac{x}{y}+\frac{y}{z}+\frac{z}{x}\geqslant\frac{z(x+y)}{y(y+z)}+\frac{x(y+z)}{z(z+x)}+\frac{y(z+x)}{x(x+y)}.\]
The same as P1 from Day 7, Group NG - P2
The same as P2 from Day 7, Group NG - P3
The same as P3 from Day 7, Group NG - P4
June 16, 2014 (Group NG) - Day 8
Let $p{}$ be a prime number and $x_1,x_2,\ldots,x_p$ be integers for which $x_1^n+x_2^n+\cdots+x_p^n$ is divisible by $p{}$ for any positive integer $n{}$. Prove that $x_1-x_2$ is divisible by $p{}.$
The polygon $M{}$ is bicentric. The polygon $P{}$ has vertices at the points of contact of the sides of $M{}$ with the inscribed circle. The polygon $Q{}$ is formed by the external bisectors of the angles of $M{}.$ Prove that $P{}$ and $Q{}$ are homothetic.
Find the maximum value of real number $k$ such that \[\frac{a}{1+9bc+k(b-c)^2}+\frac{b}{1+9ca+k(c-a)^2}+\frac{c}{1+9ab+k(a-b)^2}\geq \frac{1}{2}\] holds for all non-negative real numbers $a,\ b,\ c$ satisfying $a+b+c=1$.
June 16, 2014 (Groups A & B) - Day 8
A regular 1001-gon is drawn on a board, the vertiecs of which are numbered with $1,2,\ldots,1001.$ Is it possible to label the vertices of a cardboard 1001-gon with the numbers $1,2,\ldots,1001$ such that for any overlap between the two 1001-gons, there are two vertices with the same number one over the other? Note that the cardboard polygon can be inverted.
The same as P1 from Day 8, Group NG - P2
On the sides $AB{}$ and $AC{}$ of the acute-angled triangle $ABC{}$ the points $M{}$ and $N{}$ are chosen such that $MN$ passes through the circumcenter of $ABC.$ Let $P{}$ and $Q{}$ be the midpoints of the segments $CM{}$ and $BN{}.$ Prove that $\angle POQ=\angle BAC.$
The same as P3 from Day 8, Group NG - P4
June 17, 2014 (Group NG) - Day 9
Finitely many lines are given, which pass through some point $P{}.$ Prove that these lines can be coloured red and blue and one can find a point $Q\neq P$ such that the sum of the distances from $Q{}$ to the red lines is equal to the sum of the distance from $Q{}$ to the blue lines.
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
Players $A$ and $B$ play a "paintful" game on the real line. Player $A$ has a pot of paint with four units of black ink. A quantity $p$ of this ink suffices to blacken a (closed) real interval of length $p$. In every round, player $A$ picks some positive integer $m$ and provides $1/2^m $ units of ink from the pot. Player $B$ then picks an integer $k$ and blackens the interval from $k/2^m$ to $(k+1)/2^m$ (some parts of this interval may have been blackened before). The goal of player $A$ is to reach a situation where the pot is empty and the interval $[0,1]$ is not completely blackened. Decide whether there exists a strategy for player $A$ to win in a finite number of moves.
June 17, 2014 (Groups A & B) - Day 9
The inscribed circle of the triangle $ABC{}$ touches the sides $BC,CA$ and $AB{}$ at $A',B'$ and $C'{}$ respectively. Let $I_a$ be the $A$-excenter of $ABC{}.$ Prove that $I_aA'$ is perpendicular to the line determined by the circumcenters of $I_aBC'$ and $I_aCB'.$
The same as P1 from Day 9, Group NG - P2
The same as P2 from Day 9, Group NG - P3
The same as P3 from Day 9, Group NG - P4
June 22, 2014 (Group NG) - Day 10
Given are twenty-two different five-element sets, such that any two of them have exactly two elements in common. Prove that they all have two elements in common.
A circle centered at $O{}$ passes through the vertices $B{}$ and $C{}$ of the acute-angles triangle $ABC$ and intersects the sides $AC{}$ and $AB{}$ at $D{}$ and $E{}$ respectively. The segments $CE$ and $BD$ intersect at $U{}.$ The ray $OU$ intersects the circumcircle of $ABC$ at $P{}.$ Prove that the incenters of the triangles $PEC$ and $PBD$ coincide.
Let $n>1$ be an integer and $x_1,x_2,\ldots,x_n$ be $n{}$ arbitrary real numbers. Determine the minimum value of \[\sum_{i<j}|\cos(x_i-x_j)|.\]
June 22, 2014 (Groups A & B) - Day 10
Nine numbers $a, b, c, \dots$ are arranged around a circle. All numbers of the form $a+b^c, \dots$ are prime. What is the largest possible number of different numbers among $a, b, c, \dots$?
In the quadrilateral $ABCD$ the angles $B{}$ and $D{}$ are straight. The lines $AB{}$ and $DC{}$ intersect at $E$ and the lines $AD$ and $BC$ intersect at $F{}.$ The line passing through $B{}$ parallel to $C{}$D intersects the circumscribed circle $\omega$ of $ABF{}$ at $K{}$ and the segment $KE{}$ intersects $\omega$ at $P{}.$ Prove that the line $AP$ divides the segment $CE$ in half.
Let $x,y,z$ be real numbers. Find the minimum value of the sum \begin{align*}|\cos(x)|+|\cos(y)|+|\cos(z)|+|\cos(x-y)|+|\cos(y-z)|+|\cos(z-x)|.\end{align*}
For a natural number $n{},$ determine the number of ordered pairs $(S,T)$ of subsets of $\{1,2,\ldots,n\}$ for which $s>|T|$ for any element $s\in S$ and $t>|S|$ for any element $t\in T.$
June 23, 2014 (Group NG) - Day 11
Let $R{}$ and $r{}$ be the radii of the circumscribed and inscribed circles of the acute-angled triangle $ABC{}$ respectively. The point $M{}$ is the midpoint of its largest side $BC.$ The tangents to its circumscribed circle at $B{}$ and $C{}$ intersect at $X{}$. Prove that \[\frac{r}{R}\geqslant\frac{AM}{AX}.\]
Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $. We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.
Find all functions $f : \mathbb{R}\to\mathbb{R}$ such that $f(0) = 0$ and for any real numbers $x, y$ the following equality holds \[f(x^2+yf(x))+f(y^2+xf(y))=f(x+y)^2.\]
June 23, 2014 (Groups A & B) - Day 11
On each non-boundary unit segment of an $8\times 8$ chessboard, we write the number of dissections of the board into dominoes in which this segment lies on the border of a domino. What is the last digit of the sum of all the written numbers?
Let $p,q$ and $s{}$ be prime numbers such that $2^sq =p^y-1$ where $y > 1.$ Find all possible values of $p.$
The same as P1 from Day 11, Group NG - P3
The same as P3 from Day 11, Group NG - P4