A positive integer $n$ is known as an [i]interesting[/i] number if $n$ satisfies \[{\ \{\frac{n}{10^k}} \} > \frac{n}{10^{10}} \] for all $k=1,2,\ldots 9$. Find the number of interesting numbers.

Factorise $$(a+2b-3c)^3+(b+2c-3a)^3+(c+2a-3b)^3$$

The integers $a_0, a_1, a_2, a_3,\ldots$ are defined as follows: $a_0 = 1$, $a_1 = 3$, and $a_{n+1} = a_n + a_{n-1}$ for all $n \ge 1$. Find all integers $n \ge 1$ for which $na_{n+1} + a_n$ and $na_n + a_{n-1}$ share a common factor greater than $1$.

In a certain country there are $n$ cities. Some pairs of cities are connected by highways in such a way that for each two cities there is at most one highway connecting them. Assume that for a certain positive integer $k$, the total number of highways is greater than $\frac{nk}{2}$. Show that there exist $k+2$ distinct cities $C_1, C_2, \dots, C_{k+2}$ such that $C_i$ and $C_{i+1}$ are connected by a highway for $i=1, 2, \dots, k+1$. [i]Proposed by Oriol Solé[/i]

Points $K$, $L$, $M$ lie on the sides $BC$, $CA$, $AB$ of equilateral triangle $ABC$ respectively, and satisfy the conditions $KM=LM$, $\angle KML=90^\circ$, and $AM=BK$. Prove that $\angle CKL=90^\circ$.

Let $ABCD$ be a trapezoid with $AB$ parallel to $CD$, $|AB|>|CD|$, and equal edges $|AD|=|BC|$. Let $I$ be the center of the circle tangent to lines $AB$, $AC$ and $BD$, where $A$ and $I$ are on opposite sides of $BD$. Let $J$ be the center of the circle tangent to lines $CD$, $AC$ and $BD$, where $D$ and $J$ are on opposite sides of $AC$. Prove that $|IC|=|JB|$.

Determine the least integer $n$ such that for any set of $n$ lines in the 2D plane, there exists either a subset of $1001$ lines that are all parallel, or a subset of $1001$ lines that are pairwise nonparallel. [i]Proposed by Samuel Wang[/i] [hide=Solution][i]Solution.[/i] $\boxed{1000001}$ Since being parallel is a transitive property, we note that in order for this to not exist, there must exist at most $1001$ groups of lines, all pairwise intersecting, with each group containing at most $1001$ lines. Thus, $n = 1000^2 + 1 = \boxed{1000001}$.[/hide]

[b]a.)[/b] Let $a,b$ be real numbers. Define sequence $x_k$ and $y_k$ such that \[x_0 = 1, y_0 = 0, x_{k+1} = a \cdot x_k - b \cdot y_l, \quad y_{k+1} = x_k - a \cdot y_k \text{ for } k = 0,1,2, \ldots \] Prove that \[x_k = \sum^{[k/2]}_{l=0} (-1)^l \cdot a^{k - 2 \cdot l} \cdot \left(a^2 + b \right)^l \cdot \lambda_{k,l}\] where $\lambda_{k,l} = \sum^{[k/2]}_{m=l} \binom{k}{2 \cdot m} \cdot \binom{m}{l}$ [b]b.)[/b] Let $u_k = \sum^{[k/2]}_{l=0} \lambda_{k,l} $. For positive integer $m,$ denote the remainder of $u_k$ divided by $2^m$ as $z_{m,k}$. Prove that $z_{m,k},$ $k = 0,1,2, \ldots$ is a periodic function, and find the smallest period.

Let $ABC$ be an acute triangle with incricle $(I)$. $(K_{A})$ is the cricle such that $A\in (K_{A})$ and $AK_{A}\perp BC$ and it in-tangent for $(I)$ at $A_{1}$, similary we have $B_{1},C_{1}$. a) Prove that $AA_{1},BB_{1},CC_{1}$ are concurrent, called point-concurrent is $P$. b) Assume circles $(J_{A}),(J_{B}),(J_{C})$ are symmetry for excircles $(I_{A}),(I_{B}),(I_{C})$ across midpoints of $BC,CA,AB$ ,resp. Prove that $P_{P/(J_{A})}=P_{P/(J_{B})}=P_{P/(J_{C})}$. Note. If $(O;R)$ is a circle and $M$ is a point then $P_{M/(O)}=OM^{2}-R^{2}$.

Take any point $P_1$ on the side $BC$ of a triangle $ABC$ and draw the following chain of lines: $P_1P_2$ parallel to $AC$; $P_2P_3$ parallel to $BC$; $P_3P_4$ parallel to $AB$ ; $P_4P_5$ parallel to $CA$; and $P_5P_6$ parallel to $BC$, Here, $P_2,P_5$ lie on $AB$; $P_3,P_6$ lie on $CA$ and $P_4$ on $BC$> Show that $P_6P_1$ is parallel to $AB$.

Find all real $x, y$ such that $$\begin{cases}(1 + x)(1 + x^2)(1 + x^4) = 1+ y^7 \\ (1 + y)(1 + y^2)(1 + y^4) = 1+ x^7 \end{cases}$$

A square piece of paper has side length $1$ and vertices $A,B,C,$ and $D$ in that order. As shown in the figure, the paper is folded so that vertex $C$ meets edge $\overline{AD}$ at point $C’$, and edge $\overline{BC}$ intersects edge $\overline{AB}$ at point $E$. Suppose that $C’D=\frac{1}{3}$. What is the perimeter of $\triangle AEC’$? [asy] //Diagram by Samrocksnature pair A=(0,1); pair CC=(0.666666666666,1); pair D=(1,1); pair F=(1,0.62); pair C=(1,0); pair B=(0,0); pair G=(0,0.25); pair H=(-0.13,0.41); pair E=(0,0.5); dot(A^^CC^^D^^C^^B^^E); draw(E--A--D--F); draw(G--B--C--F, dashed); fill(E--CC--F--G--H--E--CC--cycle, gray); draw(E--CC--F--G--H--E--CC); label("A",A,NW); label("B",B,SW); label("C",C,SE); label("D",D,NE); label("E",E,NW); label("C'",CC,N); [/asy] $\textbf{(A) }2 \qquad \textbf{(B) }1+\frac{2}{3}\sqrt{3} \qquad \textbf{(C) }\frac{13}{6} \qquad \textbf{(D) }1+\frac{3}{4}\sqrt{3} \qquad \textbf{(E) }\frac{7}{3}$

Find all quadruples $(a, b, c, d)$ of real numbers such that \[a + bcd = b + cda = c + dab = d + abc.\]

Let $ABC$ be a triangle, and let $D, E$ and $F$ be the feet of the altitudes from $A, B$ and $C,$ respectively. A circle $\omega_A$ through $B$ and $C$ crosses the line $EF$ at $X$ and $X'$. Similarly, a circle $\omega_B$ through $C$ and $A$ crosses the line $FD$ at $Y$ and $Y',$ and a circle $\omega_C$ through $A$ and $B$ crosses the line $DE$ at $Z$ and $Z'$. Prove that $X, Y$ and $Z$ are collinear if and only if $X', Y'$ and $Z'$ are collinear. [i]Vlad Robu[/i]

Determine all finite sets $S$ of points in the plane with the following property: if $x,y,x',y'\in S$ and the closed segments $xy$ and $x'y'$ intersect in only one point, namely $z$, then $z\in S$.

Let $X$ be the set of all lattice points in the plane (points $(x, y)$ with $x, y \in \mathbb{Z}$). A path of length $n$ is a chain $(P_0, P_1, ... , P_n)$ of points in $X$ such that $P_{i-1}P_i = 1$ for $i = 1, ... , n$. Let $F(n)$ be the number of distinct paths beginning in $P_0=(0,0)$ and ending in any point $P_n$ on line $y = 0$. Prove that $F(n) = \binom{2n}{n}$

$11$ students take a test. For any two question in a test, there are at least $6$ students who solved exactly one of those two questions. Prove that there are no more than $12$ questions in this test. Showing the equality case is not needed.

Let $a, b$ and $c$ be positive real numbers satisfying $$\frac{1}{a + 2019}+\frac{1}{b + 2019}+\frac{1}{c + 2019}=\frac{1}{2019}.$$ Prove that $abc \ge 4038^3$.

Alice is performing a magic trick. She has a standard deck of 52 cards, which she may order beforehand. She invites a volunteer to pick an integer \(0\le n\le 52\), and cuts the deck into a pile with the top \(n\) cards and a pile with the remaining \(52-n\). She then gives both piles to the volunteer, who riffles them together and hands the deck back to her face down. (Thus, in the resulting deck, the cards that were in the deck of size \(n\) appear in order, as do the cards that were in the deck of size \(52-n\).) Alice then flips the cards over one-by-one from the top. Before flipping over each card, she may choose to guess the color of the card she is about to flip over. She stops if she guesses incorrectly. What is the maximum number of correct guesses she can guarantee? [i]Proposed by Espen Slettnes[/i]

Given six points on a circle, $A, a, B, b, C, c$, show that the Pascal lines of the hexagrams $AaBbCc, AbBcCa, AcBaCb$ are concurrent.

Two treasure-hunters found a treasure containing coins of value $a_1< a_2 < ... < a_{2003}$ (the quantity of coins of each value is unlimited). The first treasure-hunter forms all the possible sets of different coins containing odd number of elements, and takes the most valuable coin of each such set. The second treasure-hunter forms all the possible sets of different coins containing even number of elements, and takes the most valuable coin of each such set. Which one of them is going to have more money and how much more? (H. Nestra)

We call a pentagon [i]distinguished [/i] if either all side lengths or all angles are equal. We call it [i]very distinguished[/i] if in addition two of the other parts are equal. i.e. $5$ sides and $2$ angles or $2$ sides and $5$ angles.Show that every very distinguished pentagon has an axis of symmetry.

Initially memory of computer contained a single polynomial $x^2-1$. Every minute computer chooses any polynomial $f(x)$ from its memory and writes $f(x^2-1)$ and $f(x)^2-1$ to it, or chooses any two distinct polynomials $g(x), h(x)$ from its memory and writes polynomial $\frac{g(x) + h(x)}{2}$ to it (no polynomial is ever erased from its memory). Can it happen that after some time, memory of computer contains $P(x) = \frac{1}{1024}(x^2-1)^{2048} - 1$? [i](Proposed by Arsenii Nikolaiev)[/i]

We wish to construct a matrix with $19$ rows and $86$ columns, with entries $x_{ij} \in \{0, 1, 2\} \ (1 \leq i \leq 19, 1 \leq j \leq 86)$, such that: [i](i)[/i] in each column there are exactly $k$ terms equal to $0$; [i](ii)[/i] for any distinct $j, k \in \{1, . . . , 86\}$ there is $i \in \{1, . . . , 19\}$ with $x_{ij} + x_{ik} = 3.$ For what values of $k$ is this possible?

Each member of a set of circles in the $xy$-plane is tangent to the $x$-axis and no two of the circles intersect. Show that (a) the points of tangency can include all rational points on the axis. (b) the points of tangency cannot include all the irrational points.