The International Mathematical Olympiad is being organized in Japan, where a folklore belief is that the number $4$ brings bad luck. The opening ceremony takes place at the Grand Theatre where each row has the capacity of $55$ seats. What is the maximum number of contestants that can be seated in a single row with the restriction that no two of them are $4$ seats apart (so that bad luck during the competition is avoided)?

A circle is divided by $2019$ points into equal parts. Two players delete these points in turns. A player loses, if after his turn it is possible to draw a diameter of the circle such that there are no undeleted points on one side of it. Which player has a winning strategy?

Count the sum of the four-digit positive integers containing only odd digits in their decimal representation.

Given a set $S$ of $n$ variables, a binary operation $\times$ on $S$ is called [i]simple[/i] if it satisfies $(x \times y) \times z = x \times (y \times z)$ for all $x,y,z \in S$ and $x \times y \in \{x,y\}$ for all $x,y \in S$. Given a simple operation $\times$ on $S$, any string of elements in $S$ can be reduced to a single element, such as $xyz \to x \times (y \times z)$. A string of variables in $S$ is called[i] full [/i]if it contains each variable in $S$ at least once, and two strings are [i]equivalent[/i] if they evaluate to the same variable regardless of which simple $\times$ is chosen. For example $xxx$, $xx$, and $x$ are equivalent, but these are only full if $n=1$. Suppose $T$ is a set of strings such that any full string is equivalent to exactly one element of $T$. Determine the number of elements of $T$.

Given two positive integers $m$ and $n$, find the smallest positive integer $k$ such that among any $k$ people, either there are $2m$ of them who form $m$ pairs of mutually acquainted people or there are $2n$ of them forming $n$ pairs of mutually unacquainted people.

Alice and Bob are playing hide and seek. Initially, Bob chooses a secret fixed point $B$ in the unit square. Then Alice chooses a sequence of points $P_0, P_1, \ldots, P_N$ in the plane. After choosing $P_k$ (but before choosing $P_{k+1}$) for $k \geq 1$, Bob tells "warmer'' if $P_k$ is closer to $B$ than $P_{k-1}$, otherwise he says "colder''. After Alice has chosen $P_N$ and heard Bob's answer, Alice chooses a final point $A$. Alice wins if the distance $AB$ is at most $\frac 1 {2020}$, otherwise Bob wins. Show that if $N=18$, Alice cannot guarantee a win.

A connected graph has $100$ vertices, the degrees of all the vertices do not exceed $4$ and no two vertices of degree $4$ are adjacent. Prove that it is possible to remove several edges that have no common vertices from this graph such that there would be no triangles in the resulting graph.

On a river with a current speed of \(3 \, \text{km/h}\), there are two harbors. Every Saturday, a cruise ship departs from Harbor 1 to Harbor 2, stays overnight, and returns to Harbor 1 on Sunday. On the ship live two snails, Romeo and Juliet. One Saturday, immediately after the ship departs, both snails start moving to meet each other and do so exactly when the ship arrives at Harbor 2. On the following Sunday, as the ship departs from Harbor 2, Romeo starts moving towards Juliet's house and reaches there exactly when the ship arrives back at Harbor 1. Given that Juliet moves half as fast as Romeo, determine the speed of the ship in still water. [i]Proposed by Demetre Gelashvili, Georgia [/i]

A monkey in Zoo becomes lucky if he eats three different fruits. What is the largest number of monkeys one can make lucky, by having $20$ oranges, $30$ bananas, $40$ peaches and $50$ tangerines? Justify your answer. (A): $30$ (B): $35$ (C): $40$ (D): $45$ (E): None of the above.

Find all finite sequences $(x_0, x_1, \ldots,x_n)$ such that for every $j$, $0 \leq j \leq n$, $x_j$ equals the number of times $j$ appears in the sequence.

[b]p1.[/b] Ivan Ivanovich came to the store with $20$ rubles. The store sold brooms for $1$ ruble. $17$ kopecks and basins for $1$ rub. $66$ kopecks (there are no other products left in the store). How many brooms and how many basins does he need to buy in order to spend as much money as possible? (Note: $1$ ruble = $100$ kopecks) [b]p2.[/b] On the road from city A to city B there are kilometer posts. On each pillar, on one side, the distance to city A is written, and on the other, to B. In the morning, a tourist passed by a pillar on which one number was twice the size of the other. After walking another $10$ km, the tourist saw a post on which the numbers differed exactly three times. What is the distance from A to B? List all possibilities. [b]p3.[/b] On New Year's Eve, geraniums, crocuses and cacti stood in a row (from left to right) on the windowsill. Every morning, Masha, wiping off the dust, swaps the places of the flower on the right and the flower in the center. During the day, Tanya, while watering flowers, swaps places between the one in the center and the one on the left. In what order will the flowers be in 365 days on the next New Year's Eve? [b]p4.[/b] What is the smallest number of digits that must be written in a row so that by crossing out some digits you can get any three-digit natural number from $100$ to $999$? [b]p5.[/b] An ordinary irreducible fraction was written on the board, the numerator and denominator of which were positive integers. The numerator was added to its denominator and a new fraction was obtained. The denominator was added to the numerator of the new fraction to form a third fraction. When the numerator was added to the denominator of the third fraction, the result was $13/23$. What fraction was written on the board? [b]p6.[/b] The number $x$ is such that $15\%$ of it and $33\%$ of it are positive integers. What is the smallest number $x$ (not necessarily an integer!) with this property? [b]p7.[/b] A radio-controlled toy leaves a certain point. It moves in a straight line, and on command can turn left exactly $17^o$ (relative to the previous direction of movement). What is the smallest number of commands required for the toy to pass through the starting point again? [b]p8.[/b] The square is divided by straight lines into $25$ rectangles (fig. 1). The areas of some of them are indicated in the figure (not to scale). Find the area of the rectangle marked with a question mark. [img]https://cdn.artofproblemsolving.com/attachments/0/9/591c93421067123d50382744f9d28357acf83a.png[/img] [b]p9.[/b] Petya multiplied all natural numbers from $1$ to his age inclusive. The result is a number $$8 \,\, 841 \,\,761993 \,\,739 \,\,701954 \,\,543 \,\,616 \,\,000 \,\,000.$$ How old is Petya? [b]p10.[/b] There are $100$ integers written in a line, and the sum of any three in a row is equal to $10$ or $11$. The first number is equal to one. What could the last number be? List all possibilities. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

A rectangle-shaped puzzle is assembled with $2000$ pieces that are all equal rectangles, and similar to the large rectangle, so that the sides of the small rectangles are parallel to those of the large one. The shortest side of each piece measures $1$. Determine what is the minimum possible value of the area of the large rectangle.

For each integer $n > 3$ find all quadruples $(n_1,n_2,n_3,n_4)$ of positive integers with $n_1 +n_2 +n_3 +n_4 = n$ which maximize the expression $$\frac{n!}{n_1!n_2!n_3!n_4!}2^{ {n_1 \choose 2}+{n_2 \choose 2}+{n_3 \choose 2}+{n_4 \choose 2}+n_1n_2+n_2n_3+n_3n_4}$$

A beetle crawls along the edges of an $n$-lateral pyramid, starting and ending at the midpoint $A$ of a base edge and passing through each point at most once. How many ways are there for the beetle to do this (two ways are said to be equal if they go through the same vertices)? Show that the sum of the numbers of passed vertices (over all these ways) equals $1^2 +2^2 +\ldots +n^2. $

Let $k$ be a positive integer and $M_k$ the set of all the integers that are between $2 \cdot k^2 + k$ and $2 \cdot k^2 + 3 \cdot k,$ both included. Is it possible to partition $M_k$ into 2 subsets $A$ and $B$ such that \[ \sum_{x \in A} x^2 = \sum_{x \in B} x^2. \]

Given a cube, a cubic box, that exactly suits for the cube, and six colours. First man paints each side of the cube with its (side's) unique colour. Another man does the same with the box. Prove that the third man can put the cube in the box in such a way, that every cube side will touch the box side of different colour.

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

A dog has infinitely many pieces of meat, but on each piece of meat there is a fly. At each move, the dog does the following: [list=1] [*] He eats a piece of meat together with all flies lying on it; [*] He moves a fly from a piece of meat to another. [/list] The dog doesn't want to eat more than one milion flies. Prove that he cannot ensure that each piece of meat is eaten at some point. [i]Proposed by I. Mitrofanov[/i]

Let $n>1$ be an integer and $S_n$ the set of all permutations $\pi : \{1,2,\cdots,n \} \to \{1,2,\cdots,n \}$ where $\pi$ is bijective function. For every permutation $\pi \in S_n$ we define: \[ F(\pi)= \sum_{k=1}^n |k-\pi(k)| \ \ \text{and} \ \ M_{n}=\frac{1}{n!}\sum_{\pi \in S_n} F(\pi) \] where $M_n$ is taken with all permutations $\pi \in S_n$. Calculate the sum $M_n$.

In one galaxy, there exist more than one million stars. Let $M$ be the set of the distances between any $2$ of them. Prove that, in every moment, $M$ has at least $79$ members. (Suppose each star as a point.)

[b]p1.[/b] Given two irreducible fractions. The denominator of the first fraction is $4$, the denominator of the second fraction is $6$. What can the denominator of the product of these fractions be equal to if the product is represented as an irreducible fraction? [b]p2.[/b] Three horses compete in the race. The player can bet a certain amount of money on each horse. Bets on the first horse are accepted in the ratio $1: 4$. This means that if the first horse wins, then the player gets back the money bet on this horse, and four more times the same amount. Bets on the second horse are accepted in the ratio $1:3$, on the third -$ 1:1$. Money bet on a losing horse is not returned. Is it possible to bet in such a way as to win whatever the outcome of the race? [b]p3.[/b] A quadrilateral is inscribed in a circle, such that the center of the circle, point $O$, is lies inside it. Let $K$, $L$, $M$, $N$ be the midpoints of the sides of the quadrilateral, following in this order. Prove that the bisectors of angles $\angle KOM$ and $\angle LOC$ are perpendicular (Fig.). [img]https://cdn.artofproblemsolving.com/attachments/b/8/ea4380698eba7f4cc2639ce20e3057e0294a7c.png[/img] [b]p4.[/b] Prove that the number$$\underbrace{33...33}_{1999 \,\,\,3s}1$$ is not divisible by $7$. [b]p5.[/b] In triangle $ABC$, the median drawn from vertex $A$ to side $BC$ is four times smaller than side $AB$ and forms an angle of $60^o$ with it. Find the greatest angle of this triangle. [b]p6.[/b] Given a $7\times 8$ rectangle made up of 1x1 cells. Cut it into figures consisting of $1\times 1$ cells, so that each figure consists of no more than $5$ cells and the total length of the cuts is minimal (give an example and prove that this cannot be done with a smaller total length of the cuts). You can only cut along the boundaries of the cells. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

Jacob has a piece of bread shaped like a figure $8$, marked into sections and all initially connected as one piece of bread. The central part of the “$8$” is a single section, and each of the two loops of “$8$” is divided into an additional $1010$ pieces. For each section, there is a $50$ percent chance that Jacob will decide to cut it out and give it to a friend, and this is done independently for each section. The remaining sections of bread form some number of connected pieces. If $E$ is the expected number of these pieces, and $k$ is the smallest positive integer so that $2^k(E - \lfloor E \rfloor ) \ge 1$, find $\lfloor E \rfloor +k$. (Here, we say that if Jacob donates all pieces, there are $0$ pieces left).

For a competition a school wants to nominate a team of $k$ students, where $k$ is a given positive integer. Each member of the team has to compete in the three disciplines juggling, singing and mental arithmetic. To qualify for the team, the $n \ge 2$ students of the school compete in qualifying competitions, determining a unique ranking in each of the three disciplines. The school now wants to nominate a team satisfying the following condition: $(*)$ [i]If a student $X$ is not nominated for the team, there is a student $Y$ on the team who defeated $X$ in at least two disciplines.[/i] Determine all positive integers $n \ge 2$ such that for any combination of rankings, a team can be chosen to satisfy the condition $(*)$, when a) $k=2$, b) $k=3$.

There are $456$ people around a circle, denoted as $X_1, X_2, \dots, X_{456}$, and each one of them thought of a number. Every time Laura says an integer $k$ with $2 \leqslant k \leqslant 100$, the announcer announces all the numbers $p_1, p_2, \dots, p_{456}$, which are the averages of the numbers thought by the people in all the groups of $k$ consecutive people: $p_1$ is the average of the numbers thought by the people from $X_1$ to $X_k$, $p_2$ is the average of the numbers thought by the people from $X_2$ to $X_{k+1}$, and so on until $p_{456}$, the average of the numbers thought by the people from $X_{456}$ to $X_{k-1}$. Determine how many numbers $k$ Laura must say at a minimum so that, with certainty, the announcer can know the number thought by the person $X_{456}$.

A box whose shape is a parallelepiped can be completely filled with cubes of side $1.$ If we put in it the maximum possible number of cubes, each of volume $2$, with the sides parallel to those of the box, then exactly $40$ percent of the volume of the box is occupied. Determine the possible dimensions of the box.