Fix a point $O$ in the plane and an integer $n\geq 3$. Consider a finite family $\mathcal{D}$ of closed unit discs in the plane such that: (a) No disc in $\mathcal{D}$ contains the point $O$; and (b) For each positive integer $k < n$, the closed disc of radius $k + 1$ centred at $O$ contains the centres of at least $k$ discs in $\mathcal{D}$. Show that some line through $O$ stabs at least $\frac{2}{\pi} \log \frac{n+1}{2}$ discs in $\mathcal{D}$.

Let $A$ be an infinite set of positive integers such that every $n \in A$ is the product of at most $1987$ prime numbers. Prove that there is an infinite set $B \subset A$ and a number $p$ such that the greatest common divisor of any two distinct numbers in $B$ is $p.$

There are 100 merchants who are selling salmon for Durer dollars around the circular shore of the island of Durerland. Since the beginning of times good and bad years have been alternating on the island. (So after a good year, the next year is bad; and after a bad year, the next year is good.) In every good year all merchants set their price as the maximum value between their own selling price from the year before and the selling price of their left-hand neighbour from the year before. In turn, in every bad year they sell it for the minimum between their own price from the year before and their left-hand neighbour’s price from the year before. Paul and Pauline are two merchants on the island. This year Paul is selling salmon for 17 Durer dollars a kilogram. Prove that there will come a year when Pauline will sell salmon for 17 Durer dollars a kilogram. [i]Note: The merchants are immortal, they have been selling salmon on the island for thousands of years and will continue to do so until the end of time.[/i]

Convex figure $\mathcal{K}$ has the following property: if one looks at $\mathcal{K}$ from any point of the certain circle $\mathcal{Y}$, then $\mathcal{K}$ is seen in the right angle. Show that the figure is symmetric with respect to the centre of $\mathcal{Y.}$

Let $n=3k+1$, where $k$ is a positive integer. A triangular arrangement of side $n$ is formed using circles with the same radius, as is shown in the figure for $n=7$. Determine, for each $k$, the largest number of circles that can be colored red in such a way that there are no two mutually tangent circles that are both colored red.

Hamster is playing a game on an $m \times n$ chessboard. He places a rook anywhere on the board and then moves it around with the restriction that every vertical move must be followed by a horizontal move and every horizontal move must be followed by a vertical move. For what values of $m,n$ is it possible for the rook to visit every square of the chessboard exactly once? A square is only considered visited if the rook was initially placed there or if it ended one of its moves on it. [i]Brian Hamrick.[/i]

Yesterday, $n\ge 4$ people sat around a round table. Each participant remembers only who his two neighbours were, but not necessarily which one sat on his left and which one sat on his right. Today, you would like the same people to sit around the same round table so that each participant has the same two neighbours as yesterday (it is possible that yesterday’s left-hand side neighbour is today’s right-hand side neighbour). You are allowed to query some of the participants: if anyone is asked, he will answer by pointing at his two neighbours from yesterday. a) Determine the minimal number $f(n)$ of participants you have to query in order to be certain to succeed, if later questions must not depend on the outcome of the previous questions. That is, you have to choose in advance the list of people you are going to query, before effectively asking any question. b) Determine the minimal number $g(n)$ of participants you have to query in order to be certain to succeed, if later questions may depend on the outcome of previous questions. That is, you can wait until you get the first answer to choose whom to ask the second question, and so on.

A bee travels in a series of steps of length $1$: north, west, north, west, up, south, east, south, east, down. (The bee can move in three dimensions, so north is distinct from up.) There exists a plane $P$ that passes through the midpoints of each step. Suppose we orthogonally project the bee’s path onto the plane $P$, and let $A$ be the area of the resulting figure. What is $A^2$?

Let $A=\{1,2,\ldots,n\}$. For a permutation $P=(P(1), P(2), \ldots, P(n))$ of the elements of $A$, let $P(1)$ denote the first element of $P$. Find the number of all such permutations $P$ so that for all $i,j \in A$: (a) if $i < j<P(1)$, then $j$ appears before $i$ in $P$; and (b) if $P(1)<i<j$, then $i$ appears before $j$ in $P$.

Let $V$ be a set of $2019$ points in space where any of the four points are not on the same plane, and $E$ be the set of edges connected between them. Find the smallest positive integer $n$ satisfying the following condition: if $E$ has at least $n$ elements, then there exists $908$ two-element subsets of $E$ such that [list][*]The two edges in each subset share a common vertice, [*]Any of the two subsets do not intersect.[/list]

Sam and Jonathan play a game where they take turns flipping a weighted coin, and the game ends when one of them wins. The coin has a $\frac89$ chance of landing heads and a $\frac19$ chance of landing tails. Sam wins when he flips heads, and Jonathan wins when he flips tails. Find the probability that Samwins, given that he takes the first turn. [i]Proposed by Samuel Tsui[/i]

One hundred and one of the squares of an $n\times n$ table are colored blue. It is known that there exists a unique way to cut the table to rectangles along boundaries of its squares with the following property: every rectangle contains exactly one blue square. Find the smallest possible $n$.

A point $P$ lies at the center of square $ABCD$. A sequence of points $\{P_n\}$ is determined by $P_0 = P$, and given point $P_i$, point $P_{i+1}$ is obtained by reflecting $P_i$ over one of the four lines $AB$, $BC$, $CD$, $DA$, chosen uniformly at random and independently for each $i$. What is the probability that $P_8 = P$?

Determine all natural numbers $n$ so that numbers $1, 2,... , n$ can be placed on the circumference of a circle and for each natural number $s$ with $1\le s \le \frac12n(n+1)$ , there is a circular arc which has the sum of all numbers in that arc to be $s$.

a) Do there exist 5 circles in the plane such that each circle passes through exactly 3 centers of other circles? b) Do there exist 6 circles in the plane such that each circle passes through exactly 3 centers of other circles?

There are two kinds of creatures living in the flatland of Pentagonia: the Spires ($S$) and the Bones ($B$). They all have the shape of an isosceles triangle: the Spiers have an apical angle of $36^o$ and the bones an apical angle of $108^o$. Every year on [i]Great Day of Division[/i] (September 11 - the day this Olympiad was held) they divide into pieces: each $S$ into two smaller $S$'s and a $B$; each $B$ in an $S$ and a $B$. Over the course of the year they then grow back to adult proportions. In the distant past, the population originated from one $B$-being. Deaths do not occur. Investigate whether the ratio between the number of Spires and the number of Bones will eventually approach a limit value and if so, calculate that limit value.

Nine points of the plane, located at the vertices of a regular nonagon, are pairwise connected by segments, each of which is colored either red or blue. It is known that in any triangle with vertices at the vertices of the nonagon at least one side is red. Prove that there are four points, any two of which are connected by red lines.

Let $ n\geqslant 3$ and $ P$ a convex $ n$-gon. Show that $ P$ can be, by $ n \minus{} 3$ non-intersecting diagonals, partitioned in triangles such that the circumcircle of each triangle contains the whole area of $ P$. Under which conditions is there exactly one such triangulation?

Each of the numbers in the set $N = \{1, 2, 3, \cdots, n - 1\}$, where $n \geq 3$, is colored with one of two colors, say red or black, so that: [i](i)[/i] $i$ and $n - i$ always receive the same color, and [i](ii)[/i] for some $j \in N$, relatively prime to $n$, $i$ and $|j - i|$ receive the same color for all $i \in N, i \neq j.$ Prove that all numbers in $N$ must receive the same color.

[b]8.1[/b] Find all primes $p,q$ and $r$ such that $$pqr= 5(p + q + r).$$ [b]8.2 [/b] Prove that if $\overline{ab}/\overline{bc} = a/c$, then $$\overline{abb...bb}/\overline{bb...bbc} = a/c$$ (each number has $n$ digits). [b]8.3 / 9.1[/b] Construct a triangle with perimeter, altitude and angle at the base. [b]8.4. / 9.4[/b] Prove that the square of the sum of N distinct non-zero squares of integers is also the sum of $N $squares of non-zero integers. [b]8.5.[/b] In the quadrilateral $ABCD$ the diagonals $AC$ and $BD$ are drawn. Prove that if the circles inscribed in $ABC$ and $ ADC$ touch each other each other, then the circles inscribed in $BAD$ and in $BCD$ also touch each other. [b]8.6 / 9.6[/b] If the numbers $A$ and $n$ are coprime, then there are integers $X$ and $Y$ such that $ |X| <\sqrt{n}$, $|Y| <\sqrt{n} $ and $AX-Y$ is divided by $n$. Prove it. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983461_1964_leningrad_math_olympiad]here[/url].

For non-empty number sets $S, T$, define the sets $S+T=\{s+t\mid s\in S, t\in T\}$ and $2S=\{2s\mid s\in S\}$. Let $n$ be a positive integer, and $A, B$ be two non-empty subsets of $\{1,2\ldots,n\}$. Show that there exists a subset $D$ of $A+B$ such that 1) $D+D\subseteq 2(A+B)$, 2) $|D|\geq\frac{|A|\cdot|B|}{2n}$, where $|X|$ is the number of elements of the finite set $X$.

a) The product of $n$ integers equals $n$, and their sum is zero. Prove that $n$ is divisible by $4$. b) Let $n$ is divisible by $4$. Prove that there exist $n$ integers such, that their product equals $n$, and their sum is zero.

In a school there are $ 2008$ students. Students are members of certain committees. A committee has at most $ 1004$ members and every two students join a common committee. (i) Determine the smallest possible number of committees in the school. (ii) If it is further required that the union of any two committees consists of at most $ 1800$ students, will your answer in (i) still hold?

A game is played on a $n \times n$ chessboard. In the beginning Bars the cat occupies any cell according to his choice. The $d$ sparrows land on certain cells according to their choice (several sparrows may land in the same cell). Bars and the sparrows play in turns. In each turn of Bars, he moves to a cell adjacent by a side or a vertex (like a king in chess). In each turn of the sparrows, precisely one of the sparrows flies from its current cell to any other cell of his choice. The goal of Bars is to get to a cell containing a sparrow. Can Bars achieve his goal a) if $d=\lfloor \frac{3\cdot n^2}{25}\rfloor$, assuming $n$ is large enough? b) if $d=\lfloor \frac{3\cdot n^2}{19}\rfloor$, assuming $n$ is large enough? c) if $d=\lfloor \frac{3\cdot n^2}{14}\rfloor$, assuming $n$ is large enough?

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]