Professor Moriarty has designed a “prime-testing trail.” The trail has $2002$ stations, labeled $1,... , 2002$. Each station is colored either red or green, and contains a table which indicates, for each of the digits $0, ..., 9$, another station number. A student is given a positive integer $n$, and then walks along the trail, starting at station $1$. The student reads the first (leftmost) digit of $n,$ and looks this digit up in station $1$’s table to get a new station location. The student then walks to this new station, reads the second digit of $n$ and looks it up in this station’s table to get yet another station location, and so on, until the last (rightmost) digit of $n$ has been read and looked up, sending the student to his or her final station. Here is an example that shows possible values for some of the tables. Suppose that $n = 19$: [img]https://cdn.artofproblemsolving.com/attachments/f/3/db47f6761ca1f350e39d53407a1250c92c4b05.png[/img] Using these tables, station $1$, digit $1$ leads to station $29$m station $29$, digit $9$ leads to station $1429$, and station $1429$ is green. Professor Moriarty claims that for any positive integer $n$, the final station (in the example, $1429$) will be green if and only if $n$ is prime. Is this possible?

Determine the integral part of $A$, where $A =\frac{1}{672}+\frac{1}{673}+... +\frac{1}{2014}$

Let $ n \geq 3$ and consider a set $ E$ of $ 2n \minus{} 1$ distinct points on a circle. Suppose that exactly $ k$ of these points are to be colored black. Such a coloring is [b]good[/b] if there is at least one pair of black points such that the interior of one of the arcs between them contains exactly $ n$ points from $ E$. Find the smallest value of $ k$ so that every such coloring of $ k$ points of $ E$ is good.

Let $ ABCD $ be a sqare and $ E $ be a point situated on the segment $ BD, $ but not on the mid. Denote by $ H $ and $ K $ the orthocenters of $ ABE, $ respectively, $ ADE. $ Show that $ \overrightarrow{BH}=\overrightarrow{KD} . $

For any square matrix $\mathcal{A}$ we define $\sin {\mathcal{A}}$ by the usual power series. \[ \sin {\mathcal{A}}=\sum_{n=0}^{\infty}\frac{(-1)^n}{(2n+1)!}\mathcal{A}^{2n+1} \] Prove or disprove : $\exists 2\times 2$ matrix $A\in \mathcal{M}_2(\mathbb{R})$ such that \[ \sin{A}=\left(\begin{array}{cc}1 & 1996 \\0 & 1 \end{array}\right) \]

Every square of a $2020 \times 2020$ chess table is painted in red or white. For every two columns and two rows, at least two of the intersection squares satisfies that they are in the same column or row and they are painted in the same color. Find the least value of number of columns and rows that are completely painted in one color.

Find the roots of the equation $(x-a)(x-b)=(x-c)(x-d)$, if you know that $a+d=b+c=2015$ and $a \ne c$ (numbers $a, b, c, d$ are not given).

Consider $n$ segments in the plane which no two intersect and between their $2n$ endpoints no three are collinear. Is the following statement true? Statement: There exists a simple $2n$-gon such that it's vertices are the $2n$ endpoints of the segments and each segment is either completely inside the polygon or an edge of the polygon.

Let be a natural number $ a\ge 2. $ Prove that for any choice of primes which has the property that none of them divides any of the numbers $ N_n=1+a+a^2+a^3+\cdots +a^{2n} , $ with natural $ n, $ there is another prime not among this choice which doesn't divide any of the numbers $ N_n. $

Prove that for every positive integer $n$ there exists a positive integer $k$, such that each of the numbers $k, k^2, \dots, k^n$ have at least one block of $2022$ in their decimal representation. For example, the numbers 4[b]2022[/b]13 and 544[b]2022[/b]1[b]2022[/b] have at least one block of $2022$ in their decimal representation.

How many multiples of $11$ of four digits, of the form $\overline{abcd}$, satisfy that $a\neq b, b\neq c$ and $c\neq a$?

Given is a acute angled triangle $ABC$. The lengths of the altitudes from $A, B$ and $C$ are successively $h_A, h_B$ and $h_C$. Inside the triangle is a point $P$. The distance from $P$ to $BC$ is $1/3 h_A$ and the distance from $P$ to $AC$ is $1/4 h_B$. Express the distance from $P$ to $AB$ in terms of $h_C$.

Fix a triangle $ABC$. The variable point $M$ in its interior is such that $\angle MAC = \angle MBC$ and $N$ is the reflection of $M$ with respect to the midpoint of $AB$. Prove that $|AM| \cdot |BM| + |CM| \cdot |CN|$ is independent of the choice of $M$.

We call an $n\times n$ matrix [i]well groomed[/i] if it only contains elements $0$ and $1$, and it does not contain the submatrix $\begin{pmatrix} 1& 0\\ 0 & 1 \end{pmatrix}.$ Show that there exists a constant $c>0$ such that every well groomed, $n\times n$ matrix contains a submatrix of size at least $cn\times cn$ such that all of the elements of the submatrix are equal. (A well groomed matrix may contain the submatrix $\begin{pmatrix} 0& 1\\ 1 & 0 \end{pmatrix}.$ )

An integer $n$, unknown to you, has been randomly chosen in the interval $[1,2002]$ with uniform probability. Your objective is to select $n$ in an ODD number of guess. After each incorrect guess, you are informed whether $n$ is higher or lower, and you $\textbf{must}$ guess an integer on your next turn among the numbers that are still feasibly correct. Show that you have a strategy so that the chance of winning is greater than $\tfrac{2}{3}$.

The tennis federation has assigned numbers to $1024$ sportsmen, participating in the tournament, according to their skill. (The tennis federation uses the olympic system of tournaments. The looser in the pair leaves, the winner meets with the winner of another pair. Thus, in the second tour remains $512$ participants, in the third -- $256$, et.c. The winner is determined after the tenth tour.) It comes out, that in the play between the sportsmen whose numbers differ more than on $2$ always win that whose number is less. What is the greatest possible number of the winner?

Find the interior angle between two sides of a regular octagon (degrees).

Two positive integers are called anagrams if every decimal digit occurs the same number of times in each of them (not counting the leading zeroes). Find all non-constant polynomials $P$ with non-negative integer coefficients so that whenever $a$ and $b$ are anagrams, $P(a)$ and $P(b)$ are anagrams as well. Proposed by Sutanay Bhattacharya

a) Show that $m^2- m +1$ is an element of the set $\{n^2 + n +1 | n \in N\}$, for any positive integer $ m$. b) Let $p$ be a perfect square, $p> 1$. Prove that there exists positive integers $r$ and $q$ such that $$p^2 + p +1=(r^2 + r + 1)(q^2 + q + 1).$$

A number is called [i]purple[/i] if it can be expressed in the form $\frac{1}{2^a 5^b}$ for positive integers $a > b$. The sum of all purple numbers can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Compute $100a + b$. [i]Proposed by Eugene Chen[/i]

In quadrilateral $ABCD$, we have $AB = 5$, $BC = 6$, $CD = 5$, $DA = 4$, and $\angle ABC = 90^\circ$. Let $AC$ and $BD$ meet at $E$. Compute $\dfrac{BE}{ED}$.

In the centre of a square swimming pool is a boy, while his teacher (who cannot swim) is standing at one corner of the pool. The teacher can run three times as fast as the boy can swim, but the boy can run faster than the teacher . Can the boy escape from the teacher?

Four heaps contain $38,45,61$ and $70$ matches respectively. Two players take turn choosing any two of the heaps and take some non-zero number of matches from one heap and some non-zero number of matches from the other heap. The player who cannot make a move, loses. Which one of the players has a winning strategy ?

Circle $\omega_1$ with radius $6$ centered at point $A$ is internally tangent at point $B$ to circle $\omega_2$ with radius $15$. Points $C$ and $D$ lie on $\omega_2$ such that $\overline{BC}$ is a diameter of $\omega_2$ and $\overline{BC} \perp \overline{AD}$. The rectangle $EFGH$ is inscribed in $\omega_1$ such that $\overline{EF} \perp \overline{BC}$, $C$ is closer to $\overline{GH}$ than to $\overline{EF}$, and $D$ is closer to $\overline{FG}$ than to $\overline{EH}$, as shown. Triangles $\triangle DGF$ and $\triangle CHG$ have equal areas. The area of rectangle $EFGH$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(5cm); defaultpen(fontsize(10pt)); pair A = (9, 0), B = (15, 0), C = (-15, 0), D = (9, 12), E = (9+12/sqrt(5), -6/sqrt(5)), F = (9+12/sqrt(5), 6/sqrt(5)), G = (9-12/sqrt(5), 6/sqrt(5)), H = (9-12/sqrt(5), -6/sqrt(5)); filldraw(G--H--C--cycle, lightgray); filldraw(D--G--F--cycle, lightgray); draw(B--C); draw(A--D); draw(E--F--G--H--cycle); draw(circle(origin, 15)); draw(circle(A, 6)); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); dot(G); dot(H); label("$A$", A, (.8, -.8)); label("$B$", B, (.8, 0)); label("$C$", C, (-.8, 0)); label("$D$", D, (.4, .8)); label("$E$", E, (.8, -.8)); label("$F$", F, (.8, .8)); label("$G$", G, (-.8, .8)); label("$H$", H, (-.8, -.8)); label("$\omega_1$", (9, -5)); label("$\omega_2$", (-1, -13.5)); [/asy]

Determine all real $x$ satisfying $$\frac{1}{\sin^2 x} -\frac{1}{\cos^2x} \ge \frac83.$$