There are $1985$ participants to an international meeting. In any group of three participants there are at least two who speak the same language. It is known that each participant speaks at most five languages. Prove that there exist at least $200$ participans who speak the same language.

A tennis tournament has at least three participants. Every participant plays exactly one match against every other participant. Moreover, every participant wins at least one of the matches he plays. (Draws do not occur in tennis matches.) Show that there are three participants $A, B $ and $C$ for which the following holds: $A$ wins against $B, B$ wins against $C$, and $C$ wins against $A$.

We would like to give a present to one of $100$ children. We do this by throwing a biased coin $k$ times, after predetermining who wins in each possible outcome of this lottery. Prove that we can choose the probability $p$ of throwing heads, and the value of $k$ such that, by distributing the $2^k$ different outcomes between the children in the right way, we can guarantee that each child has the same probability of winning.

Yukihira is counting the minimum number of lines $m$, that can be drawn on the plane so that they intersect in exactly $200$ distinct points.What is $m$?

On an infinite sheet of graph paper a table is drawn so that in each square of the table stands a number equal to the arithmetic mean of the four adjacent numbers. Out of the table a piece is cut along the lines of the graph paper. Prove that the largest number on the piece always occurs at an edge, where $x = \frac14 (a + b + c + d)$.

What is the number of ways you can choose two distinct integers $a$ and $b$ (unordered i.e. choosing $(a, b)$ is same as choosing $(b, a)$ from the set $\{1, 2, \cdots , 100\}$ such that difference between them is atmost 10, i.e. $|a-b|\leq 10$ [list=1] [*] ${{100}\choose{2}} -{{90}\choose{2}}$ [*] ${{100}\choose{2}} -90$ [*] ${{100}\choose{2}} -{{90}\choose{2}}-100$ [*] None of the above [/list]

$100$ points at a circle with radius $1$ $cm$. Show that, we find an another point such that, this point's distance to other $100$ points is greater than $100$ $cm$.

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$. Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$. Find a closed form for $a_n$. [i]Proposed by Bobby Shen[/i]

Suppose a class contains $100$ students. Let, for $1\le i\le 100$, the $i^{\text{th}}$ student have $a_i$ many friends. For $0\le j\le 99$ let us define $c_j$ to be the number of students who have strictly more than $j$ friends. Show that \begin{align*} & \sum_{i=1}^{100}a_i=\sum_{j=0}^{99}c_j \end{align*}

A positive integer $n$ is given. If there exist sets $F_1, F_2, \cdots F_m$ satisfying the following, prove that $m \le n$. (For sets $A, B$, $|A|$ is the number of elements in $A$. $A-B$ is the set of elements that are in $A$ but not $B$) (i): For all $1 \le i \le m$, $F_i \subseteq \{1,2,\cdots n\}$ (ii): $|F_1| \le |F_2| \le \cdots \le |F_m|$ (iii): For all $1 \le i < j \le m$, $|F_i-F_j|=1$.

[b]6.1. [/b] Three workers can do some work. Second and the third can together complete it twice as fast as the first, the first and the third can together complete it three times faster than the second. At what time since the first and second can do this job faster than the third? [b]6.2.[/b] Prove that the greatest common divisor of the sum of two numbers and their least common multiple is equal to their greatest common divisor the numbers themselves. [b]6.3.[/b] There were 20 schoolchildren at the consultation and 20 problems were dealt with. It turned out that each student solved two problems and each problem was solved by two schoolchildren. Prove that it is possible to organize the analysis in this way tasks so that everyone solves one problem and all tasks are solved. [hide=original wording] Наконсультациибыло20школьниковиразбиралось20задач. Оказалось, что каждый школьник решил две задачи и каждую задачу решило два школьника. Докажите, что можно так организовать разбор задач, чтобыкаждыйрассказалоднузадачуивсезадачибылирассказаны.[/hide] [b]6.4[/b].Two people Α and Β must get from point Μ to point Ν,located 15 km from M. On foot they can move at a speed of 6 km/h. In addition, they have a bicycle at their disposal, on which υou can drive at a speed of 15 km/h. A and B depart from Μ at the same time, A walks, and B rides a bicycle until meeting pedestrian C, going from N to M. Then B walks and C rides a bicycle to meeting with A, hands him a bicycle, on which he arrives at N. When must pedestrian C leave Nfor A and B to arrive at N simultaneously if he walks at the same speed as A and B? [b]6.5./ 7.1[/b] Prove that out of any six people there will always be three pairs of acquaintances or three pairs of strangers. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983442_1961_leningrad_math_olympiad]here[/url].

A word of length $n$ is an ordered sequence $x_1x_2\ldots x_n$ where $x_i$ is a letter from the set $\{ a,b,c \}$. Denote by $A_n$ the set of words of length $n$ which do not contain any block $x_ix_{i+1}, i=1,2,\ldots ,n-1,$ of the form $aa$ or $bb$ and by $B_n$ the set of words of length $n$ in which none of the subsequences $x_ix_{i+1}x_{i+2}, i=1,2,\ldots n-2,$ contains all the letters $a,b,c$. Prove that $|B_{n+1}|=3|A_n|$. [i]Vasile Pop[/i]

Given an infinity chess board and a knight on it. On how many different fields the knight can be after $n$ steps¿

A rectangle $\mathcal R$ is divided into a set $\mathcal S$ of finitely many smaller rectangles with sides parallel to the sides of $\mathcal R$ such that no three rectangles in $\mathcal S$ share a common corner. An ant is initially located at the bottom-left corner of $\mathcal R$. In one operation, we can choose a rectangle $r$ in $\mathcal S$ such that the ant is currently located at one of the corners of $r$, say $c$, and move the ant to one of the two corners of $r$ adjacent to $c$. Suppose that after a finite number of operations, the ant ends up at the top-right corner of $\mathcal R$. Prove that some rectangle $r$ in $\mathcal S$ was chosen in at least two operations.

On the blackboard there are written $100$ different positive integers . To each of these numbers is added the $\gcd$ of the $99$ other numbers . In the new $100$ numbers , is it possible for $3$ of them to be equal. [i] (С. Берлов)[/i]

A large cube of size \(4 \times 4 \times 4\) is made up of 64 small unit cubes. Exactly 16 of these small cubes must be colored red, subject to the following condition: In each block of \(1 \times 1 \times 4\), \(1 \times 4 \times 1\), and \(4 \times 1 \times 1\) cubes, there must be exactly one red cube. Determine how many different ways it is possible to choose the 16 small cubes to be colored red. Note: Two colorings are considered different even if one can be obtained from the other by rotations or symmetries of the cube.

There are $30$ students in a class. In an examination, their results were all different from each other. It is given that everyone has the same number of friends. Find the maximum number of students such that each one of them has a better result than the majority of his friends. PS. Here majority means larger than half.

A finite set of line segments, of total length $18$, belongs to a square of unit side length (we assume that the square includes its boundary and that a line segment includes its end points). The line segments are parallel to the sides of the square and may intersect one another. Prove that among the regions into which the square is divided by the line segments, at least one of these must have area not less than $0.01$. (A Berzinsh, Riga)

[b]p7.[/b] An ant starts at the point $(0, 0)$. It travels along the integer lattice, at each lattice point choosing the positive $x$ or $y$ direction with equal probability. If the ant reaches $(20, 23)$, what is the probability it did not pass through $(20, 20)$? [b]p8.[/b] Let $a_0 = 2023$ and $a_n$ be the sum of all divisors of $a_{n-1}$ for all $n \ge 1$. Compute the sum of the prime numbers that divide $a_3$. [b]p9.[/b] Five circles of radius one are stored in a box of base length five as in the following diagram. How far above the base of the box are the upper circles touching the sides of the box? [img]https://cdn.artofproblemsolving.com/attachments/7/c/c20b5fa21fbd8ce791358fd888ed78fcdb7646.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A grandpa has a finite number of boxes in his attic. Each box is a straight rectangular prism with integer edge lengths. For every box its width is greater or equal to its height and its length is greater or equal to its width. A box can be put inside another box if and only if all of its dimensions are respectively smaller than the other one's. You can put two or more boxes in a bigger box only if the smaller boxes are all already inside one of the boxes. The grandpa decided to put the boxes in each other so that there would be a minimal number of visible boxes in the attic (boxes that have not been put inside another). He decided to use the following algorithm: at each step he finds the longest sequence of boxes so that the first can be put in the second, the second can be put in the third, etc., and then he puts them inside each other in the aforementioned order. The grandpa used the algorithm until no box could be put inside another. It is known that at each step the longest sequence of boxes was unique, e.g., at no moment were there two different sequences with the same length. The grandpa now claims that he has the minimal possible number of visible boxes in his attic. Is the claim necessarily true?

A three by three square is filled with positive integers. Each row contains three different integers, the sums of each row are all the same, and the products of each row are all different. What is the smallest possible value for the sum of each row?

There is a board with the shape of an equilateral triangle with side $n$ divided into triangular cells with the shape of equilateral triangles with side $ 1$ (the figure below shows the board when $n = 4$). Each and every triangular cell is colored either red or blue. What is the least number of cells that can be colored blue without two red cells sharing one side? [img]https://cdn.artofproblemsolving.com/attachments/0/1/d1f034258966b319dc87297bdb311f134497b5.png[/img]

Cassidy has string of $n$ bits, where $n$ is a positive integer, which initially are all $0$s or $1$s. Every second, Cassidy may choose to do one of two things: 1. Change the first bit (so the first bit changes from a $0$ to a $1$, or vice versa) 2. Change the first bit after the first $1$. Let $M$ be the minimum number of such moves it takes to get from $1\dots 1$ to $0 \dots 0$ (both of length $12$), and $N$ the number of starting sequences with $12$ bits that Cassidy can turn into all $0$s. Find $M + N$.

On each OMA lottery ticket there is a $9$-digit number that only uses the digits $1, 2$ and $3$ (not necessarily all three). Each ticket has one of the three colors red, blue or green. It is known that if two banknotes do not match in any of the $9$ figures, then they are of different colors. Bill $122222222$ is red, $222222222$ is green, what color is bill $123123123$?