There are $ 1993$ towns in a country, and at least $ 93$ roads going out of each town. It's known that every town can be reached from any other town. Prove that this can always be done with no more than $ 62$ transfers.

The Knights of the Round Table are gathering. Around the table are $34 $ chairs, numbered from 1 to $34$. When everyone has sat down, it turns out that between every two knights there is a maximum of $r$ places, which can be either empty or occupied by another knight. (a) For each $r \le 15$, determine the maximum number of knights present. (b) Determine for each $r \le 15$ how many sets of occupied seats there are that match meet the given and where the maximum number of knights is present.

Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.

4 tokens are placed in the plane. If the tokens are now at the vertices of a convex quadrilateral $P$, then the following move could be performed: choose one of the tokens and shift it in the direction perpendicular to the diagonal of $P$ not containing this token; while shifting tokens it is prohibited to get three collinear tokens. Suppose that initially tokens were at the vertices of a rectangle $\Pi$, and after a number of moves tokens were at the vertices of one another rectangle $\Pi'$ such that $\Pi'$ is similar to $\Pi$ but not equal to $\Pi $. Prove that $\Pi$ is a square.

Find the number of pairs $(m, n)$ of positive integers, both of which are $\le 1000$, such that $\frac{m}{n+1}< \sqrt2 < \frac{m+1}{n}$ (recalling that $ \sqrt2 = 1.414213..$.). (D. Fomin, Leningrad)

Can the set $\{1,2,...,33\}$ be partitioned into $11$ three-element sets, in each of which one element equals the sum of the other two?

Let $n$ integers on the real axis be colored. Determine for which positive integers $k$ there exists a family $K$ of closed intervals with the following properties: i) The union of the intervals in $K$ contains all of the colored points; ii) Any two distinct intervals in $K$ are disjoint; iii) For each interval $I$ at $K$ we have ${{a}_{I}}=k.{{b}_{I}}$, where ${{a}_{I}}$ denotes the number of integers in $I$, and ${{b}_{I}}$ the number of colored integers in $I$.

In an $11 \times 11$ grid of cells, each pair of edge-adjacent cells is connected by a door. Karthik wants to walk a path in this grid. He can start in any cell, but he must end in the same cell he started in, and he cannot go through any door more than once (not even in opposite directions). Compute the maximum number of doors he can go through in such a path.

We have $n\ge3$ points on the plane such that no three are collinear. Prove that it's possible to name them $P_1,P_2,\ldots,P_n$ such that for all $1<i<n$, the angle $\angle P_{i-1}P_iP_{i+1}$ is acute.

In a Cartesian coordinate plane, call a rectangle $standard$ if all of its sides are parallel to the $x$- and $y$- axes, and call a set of points $nice$ if no two of them have the same $x$- or $y$- coordinate. First, Bert chooses a nice set $B$ of $2016$ points in the coordinate plane. To mess with Bert, Ernie then chooses a set $E$ of $n$ points in the coordinate plane such that $B\cup E$ is a nice set with $2016+n$ points. Bert returns and then miraculously notices that there does not exist a standard rectangle that contains at least two points in $B$ and no points in $E$ in its interior. For a given nice set $B$ that Bert chooses, define $f(B)$ as the smallest positive integer $n$ such that Ernie can find a nice set $E$ of size $n$ with the aforementioned properties. Help Bert determine the minimum and maximum possible values of $f(B)$. [i]Yannick Yao[/i]

A set of $n$ lights, numbered $1$ to $n$, are initially off. At every moment, it is possible to perform one of the following operations: $\bullet$ change the state of lamp $1$, $\bullet$ change the state of lamp $2$, as long as lamp $1$ is on, $\bullet$ change the state of lamp $k > 2$, as long as lamp $k - 1$ is on and all lamps $1, . . . , k - 2$ are off. It shows that it is possible, after a certain number of operations, to have only the lamp left on.

A fractional number $x$ is called [i][b]pretty[/b][/i] if it has finite expression in base$-b$ numeral system, $b$ is a positive integer in $[2;2022]$. Prove that there exists finite positive integers $n\geq 4$ that with every $m$ in $(\frac{2n}{3}; n)$ then there is at least one pretty number between $\frac{m}{n-m}$ and $\frac{n-m}{m}$

Let $N\geq 2$ be a natural number. At a mathematical olympiad training camp the same $N$ courses are organised every day. Each student takes exactly one of the $N$ courses each day. At the end of the camp, every student has takes each course exactly once, and any two students took the same course on at least one day, but took different courses on at least one other day. What is, in terms of $N$, the largest possible number of students at the camp?

There is a row with $2024$ cells. Ana and Beto take turns playing, with Ana going first. On each turn, the player selects an empty cell and places a digit in that space. Once all $2024$ cells are filled, the number obtained from reading left to right is considered, ignoring any leading zeros. Beto wins if the resulting number is a multiple of $99$, otherwise Ana wins. Determine which of the two players has a winning strategy and describe it.

[b]6.1[/b] Which number is greater $$\underbrace{1000. . . 001}_{1965\, zeroes} / \underbrace{1000 . . . 001}_{1966\, zeroes} \,\,\, or \,\,\, \underbrace{1000. . . 001}_{1966\, zeroes} / \underbrace{1000 . . . 001}_{1967\, zeroes} \,\,?$$ [b]6.2[/b] $30$ teams participate in the football championship. Prove that at any moment there will be two teams that have played at this point the same number of matches. [b]6.3./ 7.1 [/b] All integers from $1$ to $1966$ are written on the board. Allowed is to erase any two numbers by writing their difference instead. Prove that repeating such an operation many times cannot ensure that There are only zeros left on the board. [b]6.4 / 7.5[/b] Black paint was sprayed onto a white surface. Prove that there are three points of the same color lying on the same line, and so, that one of the points lies in the middle between the other two. [b]6.5[/b] In a chess tournament, there are more than three chess players, and each player plays each other the same number of times. There were $26$ rounds in the tournament. After the $13$th round, one of the participants discovered that he had an odd number points, and each of the other participants has an even number of points. How many chess players participated in the tournament? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988082_1966_leningrad_math_olympiad]here[/url].

In an urn there are one ball marked $1$, two balls marked $2$, and so on, up to $n$ balls marked $n$. Two balls are randomly drawn without replacement. Find the probability that the two balls are assigned the same number.

Ana, Bruno and Carolina played table tennis with each other. In each game, only two of the friends played, with the third one resting. Every time one of the friends won a game, they rested during the next game. Ana played $12$ games, Bruno played $21$ games and Carolina rested for$ 8$ games. Who rested in the last game?

In an island, there exist 7 towns and a railway system which connected some of the towns. Every railway segment connects 2 towns, and in every town there exists at least 3 railway segments that connects the town to another towns. Prove that there exists a route that visits 4 different towns once and go back to the original town. (Example: $ A\minus{}B\minus{}C\minus{}D\minus{}A$)

Let $D$ be the set of all pairs $(i,j)$, $1\le i,j\le n$. Prove there exists a subset $S \subset D$, with $|S|\ge\left \lfloor\frac{3n(n+1)}{5}\right \rfloor$, such that for any $(x_1,y_1), (x_2,y_2) \in S$ we have $(x_1+x_2,y_1+y_2) \not \in S$. (Peter Cameron)

Let all distances between the vertices of a convex $n$-gon ($n > 3$) be different. a) A vertex is called uninteresting if the closest vertex is adjacent to it. What is the minimal possible number of uninteresting vertices (for a given $n$)? b) A vertex is called unusual if the farthest vertex is adjacent to it. What is the maximal possible number of unusual vertices (for a given $n$)? [i](Proposed by B.Frenkin)[/i]

A permutation $ \{x_1, x_2, \ldots, x_{2n}\}$ of the set $ \{1,2, \ldots, 2n\}$ where $ n$ is a positive integer, is said to have property $ T$ if $ |x_i \minus{} x_{i \plus{} 1}| \equal{} n$ for at least one $ i$ in $ \{1,2, \ldots, 2n \minus{} 1\}.$ Show that, for each $ n$, there are more permutations with property $ T$ than without.

A sequence $2^{a_1}, 2^{a_2}, \cdots,2^{a_m}$ is called [i]good[/i], if $a_i$ are non-negative integers, and $a_{i+1}-a_{i}$ is either $0$ or $1$ for all $1\le i\le m-1$. Fix a positive integer $n$, and Ivan has a whiteboard with some ones written on it. In each step, he may erase any good sequence $2^{a_1}, 2^{a_2}, \cdots,2^{a_m}$ that appears on the whiteboard, and then he writes the number $2^k$ such that $$2^{k-1}<2^{a_1}+2^{a_2}+\cdots+2^{a_m}\le 2^{k}$$ Suppose Ivan starts with the least possible number of ones to obtain $2^n$ after some steps, determine the minimum number of steps he will need in order to do so. [i]Proposed by Ivan Chan Kai Chin[/i]

[b]p1.[/b] Prove that for every point inside a regular polygon, the average of the distances to the sides equals the radius of the inscribed circle. The distance to a side means the shortest distance from the point to the line obtained by extending the side. [b]p2.[/b] Suppose we are given positive (not necessarily distinct) integers $a_1, a_2,..., a_{1997}$ . Show that it is possible to choose some numbers from this list such that their sum is a multiple of $1997$. [b]p3.[/b] You have Blue blocks, Green blocks and Red blocks. Blue blocks and green blocks are $2$ inches thick. Red blocks are $1$ inch thick. In how many ways can you stack the blocks into a vertical column that is exactly $12$ inches high? (For example, for height $3$ there are $5$ ways: RRR, RG, GR, RB, BR.) [b]p4.[/b] There are $1997$ nonzero real numbers written on the blackboard. An operation consists of choosing any two of these numbers, $a$ and $b$, erasing them, and writing $a+b/2$ and $b-a/2$ instead of them. Prove that if a sequence of such operations is performed, one can never end up with the initial collection of numbers. [b]p5.[/b] An $m\times n$ checkerboard (m and n are positive integers) is covered by nonoverlapping tiles of sizes $2\times 2$ and $1\times 4$. One $2\times 2$ tile is removed and replaced by a $1\times 4$ tile. Is it possible to rearrange the tiles so that they cover the checkerboard? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given any four distinct points in the plane, show that the ratio of the largest to the smallest distance between two of them is at least $\sqrt2$.

Does there exist a set of $100$ triangles in which not one of the triangles can be covered by the other $99$?