There are $n$ students. Denoted the number of the selections to select two students (with their weights are $a$ and $b$) such that $\left| {a - b} \right| \le 1$ (kg) and $\left| {a - b} \right| \le 2$ (kg) by $A_1$ and $A_2$, respectively. Prove that $A_2<3A_1+n$.

The sweeties shop called "Olympiad" sells boxes of $6,9$ or $20$ chocolates. Groups of students from a school that is near the shop collect money to buy a chocolate for each student; to make this they buy a box and than give to everybody a chocolate. Like this students can create groups of $15=6+9$ students, $38=2*9+20$ students, etc. The seller has promised to the students that he can satisfy any group of students, and if he will need to open a new box of chocolate for any group (like groups of $4,7$ or $10$ students) than he will give all the chocolates for free to this group. Can there be constructed the biggest group that profits free chocolates, and if so, how many students are there in this group?

The following is a code and is meant to be broken. 2 707 156 377 38 2 328 17 185 2 713 73 566 1130 328 73 38 259 471 38 17 566 2 134 707 38 274 377 328 38 1130 40 377 566 73 820 566 566 134 11 2 328 38 185 2 713 566 134 328 2 918 134 11 713 134 274 707 713 73 38 1130 17 134 707 11 820 707 707 38 17 713 73 38 134 566 40 2 918 377 566 134 713 38 328 820 274 4 38 566 707 156 377 38 707 40 2 918 377 566 134 713 38 328 820 274 4 38 566 134 707 713 73 38 2 328 707 991 38 566 713 377 713 73 38 707 38 918 38 328 713 73 707 73 377 566 713 2 328 707 991 38 566 532 820 38 707 713 134 377 328 377 328 713 73 134 707 713 38 707 713 185 2 713 73 566 1130 328 707 40 2 918 377 566 134 713 38 328 820 274 4 38 566 134 707 713 73 38 2 328 707 991 38 566 713 377 713 73 38 707 38 11 377 328 17 259 377 328 79 2 328 707 991 38 566 532 820 38 707 713 134 377 328 377 328 713 73 134 707 713 38 707 713 991 73 2 713 134 707 713 73 38 707 820 274 377 40 713 73 38 134 566 40 2 918 377 566 134 713 38 328 820 274 4 38 566 707

There are given one black box and $n$ white boxes ($n$ is a random natural number). White boxes are numbered with the numbers $1,2,\ldots,n$. In them are put $n$ balls. It is allowed the following rearrangement of the balls: if in the box with number $k$ there are exactly $k$ balls, that box is made empty - one of the balls is put in the black box and the other $k-1$ balls are put in the boxes with numbers: $1,2,\ldots,k-1$. [i](Ivan Tonov)[/i]

Consider $n$ disks $C_{1}; C_{2}; ... ; C_{n}$ in a plane such that for each $1 \leq i < n$, the center of $C_{i}$ is on the circumference of $C_{i+1}$, and the center of $C_{n}$ is on the circumference of $C_{1}$. Define the [i]score[/i] of such an arrangement of $n$ disks to be the number of pairs $(i; j )$ for which $C_{i}$ properly contains $C_{j}$ . Determine the maximum possible score.

In the class, every talker is friends with at least one silent person. At this chatterbox is silent if there is an odd number of his friends in the office —silent. Prove that the teacher can invite you to an elective class without less than half the class so that all talkers are silent. [hide=original wording]В классе каждый болтун дружит хотя бы с одним молчуном. При этом болтун молчит, если в кабинете находится нечетное число его друзей - молчунов. Докажите, что учительмо жет пригласитьна факультатив не менее половины класса так, чтобы все болтуны молчали[/hide]

A square paper of side $n$ is divided into $n^2$ unit square cells. A maze is drawn on the paper with unit walls between some cells in such a way that one can reach every cell from every other cell not crossing any wall. Find, in terms of $n$, the largest possible total length of the walls.

On a horizontally placed number line, a pile of \( t_i > 0 \) tokens is placed on each number \( i \in \{1, 2, \ldots, s\} \). As long as at least one pile contains at least two tokens, we repeat the following procedure: we choose such a pile (say, it consists of \( k \geq 2 \) tokens), and move the top token from the selected pile \( k - 1 \) unit positions to the right along the number line. What is the largest natural number \( N \) on which a token can be placed? (Express \( N \) as a function of \( (t_i;\ i = 1, \ldots, s) \).)

In how many different ways can you write $2016$ as the sum of a sequence of consecutive natural numbers?

Given a complete bipartite graph on $n,n$ vertices (call this $K_{n,n}$), we colour all its edges with $2$ colours , red and blue . What is the least value of $n$ such that for any colouring of the edges of the graph , there will exist at least one monochromatic $4$ cycle ?

For some positive integer $n$, consider the board $n\times n$. On this board you can put any rectangles with sides along the sides of the grid. What is the smallest number of such rectangles that must be placed so that all the cells of the board are covered by distinct numbers of rectangles (possibly $0$)? The rectangles are allowed to have the same sizes. [i]Proposed by Anton Trygub[/i]

Let $S$ be the set of $10$-tuples of non-negative integers that have sum $2019$. For any tuple in $S$, if one of the numbers in the tuple is $\geq 9$, then we can subtract $9$ from it, and add $1$ to the remaining numbers in the tuple. Call thus one operation. If for $A,B\in S$ we can get from $A$ to $B$ in finitely many operations, then denote $A\rightarrow B$. (1) Find the smallest integer $k$, such that if the minimum number in $A,B\in S$ respectively are both $\geq k$, then $A\rightarrow B$ implies $B\rightarrow A$. (2) For the $k$ obtained in (1), how many tuples can we pick from $S$, such that any two of these tuples $A,B$ that are distinct, $A\not\rightarrow B$.

Arnaldo and Bernaldo train for a marathon along a circular track, which has in its center a mast with a flag raised. Arnaldo runs faster than Bernaldo, so that every $30$ minutes of running, while Arnaldo gives $15$ laps on the track, Bernaldo can only give $10$ complete laps. Arnaldo and Bernaldo left at the same moment of the line and ran with constant velocities, both in the same direction. Between minute $1$ and minute $61$ of the race, how many times did Arnaldo, Bernaldo and the mast become collinear?

Given a convex polyhedron with 2022 faces. In 3 arbitary faces, there are already number $26; 4$ and $2022$ (each face contains 1 number). They want to fill in each other face a real number that is an arithmetic mean of every numbers in faces that have a common edge with that face. Prove that there is only one way to fill all the numbers in that polyhedron.

How many ways are there to divide $10$ candies between $3$ Berkeley students and $4$ Stanford students, if each Berkeley student must get at least one candy? All students are distinguishable from each other; all candies are indistinguishable.

A school has $n$ students and some super classes are provided for them. Each student can participate in any number of classes that he/she wants. Every class has at least two students participating in it. We know that if two different classes have at least two common students, then the number of the students in the first of these two classes is different from the number of the students in the second one. Prove that the number of classes is not greater that $\left(n-1\right)^2$.

In a football tournament, $n$ teams play one round ($n \vdots 2$). In each round should play $n / 2$ pairs of teams that have not yet played. Schedule of each round takes place before its holding. For which smallest natural $k$ such that the following situation is possible: after $k$ tours, making a schedule of $k + 1$ rounds already is not possible, i.e. these $n$ teams cannot be divided into $n / 2$ pairs, in each of which there are teams that have not played in the previous $k$ rounds. PS. The 3 vertical dots notation in the first row, I do not know what it means.

Determine the largest integer $N$ for which there exists a table $T$ of integers with $N$ rows and $100$ columns that has the following properties: $\text{(i)}$ Every row contains the numbers $1$, $2$, $\ldots$, $100$ in some order. $\text{(ii)}$ For any two distinct rows $r$ and $s$, there is a column $c$ such that $|T(r,c) - T(s, c)|\geq 2$. (Here $T(r,c)$ is the entry in row $r$ and column $c$.)

Let $S$ be a set of $10$ positive integers. Prove that one can find two disjoint subsets $A =\{a_1, ..., a_k\}$ and $B = \{b_1, ... , b_k\}$ of $S$ with $|A| = |B|$ such that the sums $x =\frac{1}{a_1}+ ... +\frac{1}{a_k}$ and $y =\frac{1}{b_1}+ ... +\frac{1}{b_k}$ differ by less than $0.01$, i.e., $|x - y| < 1/100$.

A class consists of 33 students. Each student is asked how many other students in the class have his first name, and how many have his last name. It turns out that each number from 0 to 10 occurs among the answers. Show that there are two students in the class with the same first and last name. [i]A. Shapovalov[/i]

Given a positive integer $k$ and other two integers $b > w > 1.$ There are two strings of pearls, a string of $b$ black pearls and a string of $w$ white pearls. The length of a string is the number of pearls on it. One cuts these strings in some steps by the following rules. In each step: [b](i)[/b] The strings are ordered by their lengths in a non-increasing order. If there are some strings of equal lengths, then the white ones precede the black ones. Then $k$ first ones (if they consist of more than one pearl) are chosen; if there are less than $k$ strings longer than 1, then one chooses all of them. [b](ii)[/b] Next, one cuts each chosen string into two parts differing in length by at most one. (For instance, if there are strings of $5, 4, 4, 2$ black pearls, strings of $8, 4, 3$ white pearls and $k = 4,$ then the strings of 8 white, 5 black, 4 white and 4 black pearls are cut into the parts $(4,4), (3,2), (2,2)$ and $(2,2)$ respectively.) The process stops immediately after the step when a first isolated white pearl appears. Prove that at this stage, there will still exist a string of at least two black pearls. [i]Proposed by Bill Sands, Thao Do, Canada[/i]

$64$ people are in a single elimination rock-paper-scissors tournament, which consists of a $6$-round knockout bracket. Each person has a different rock-paper-scissors skill level, and in any game, the person with the higher skill level will always win. For how many players $P$ is it possible that $P$ wins the first four rounds that he plays? (A $6$-round knockout bracket is a tournament which works as follows: (a) In the first round, all 64 competitors are paired into $32$ groups, and the two people in each group play each other. The winners advance to the second round, and the losers are eliminated. (b) In the second round, the remaining $32$ players are paired into $16$ groups. Again, the winner of each group proceeds to the next round, while the loser is eliminated. (c) Each round proceeds in a similar way, eliminating half of the remaining players. After the sixth round, only one player will not have been eliminated. That player is declared the champion.) [i]In the game of rock-paper-scissors, two players each choose one of rock, paper, or scissors to play. Rock beats scissors, scissors beats paper, and paper beats rock. If the players play the same thing, the match is considered a draw.[/i]

A gambling student tosses a fair coin. She gains $1$ point for each head that turns up, and gains $2$ points for each tail that turns up. Prove that the probability of the student scoring [i]exactly[/i] $n$ points is $\frac{1}{3}\cdot\left(2+\left(-\frac{1}{2}\right)^{n}\right)$.

[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]

What is the smallest number of nodes that can be marked in a rectangular $n \times k$ grid so that each cell contains at least two marked nodes?