There is a ruble coin in each cell of the board with $2\times 200$. Dasha and Sonya play, taking turns making moves, Dasha starts. In one move, it is allowed to select any coin and move it: Dasha moves the coin to a diagonally adjacent cell, Sonya is to the side adjacent. If two coins end up in the same cell, one of them is immediately removed from the board and goes to Sonya. Sonya can stop the game at any time and take all the coins she has received. What is the biggest win she can get, no matter how she plays Dasha? [i]A. Kuznetsov[/i]

It is said that a set of three different numbers is an [i]arithmetical set[/i] if one of the three numbers is the average of the other two. Consider the set $A_n = \{1, 2,..., n\}$, where $n $ is a positive integer, $n\ge 3$. a) How many [i]arithmetical sets[/i] are in $A_{10}$? b) Find the smallest $n$, such that the number of [i]arithmetical sets[/i] in $A_n$ is greater than $2004$.

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

$2023$ wise men are located in a circle. Each of them thinks either that the earth is the center of the universe, or that it is not. Once a minute, all the wise men express their opinion at the same time. Every wise man who is between two wise men with an opinion different from his will change his mind at that moment. The others don't change their minds. The others don't change their minds. Determine the smallest necessary time for all the wise men to have the same opinion, without regardless of initial opinions or your location.

Harry Potter can do any of the three tricks arbitrary number of times: $i)$ switch $1$ plum and $1$ pear with $2$ apples $ii)$ switch $1$ pear and $1$ apple with $3$ plums $iii)$ switch $1$ apple and $1$ plum with $4$ pears In the beginning, Harry had $2012$ of plums, apples and pears, each. Harry did some tricks and now he has $2012$ apples, $2012$ pears and more than $2012$ plums. What is the minimal number of plums he can have?

[b]p1.[/b] Ten math students take a test, and the average score on the test is $28$. If five students had an average of $15$, what was the average of the other five students' scores? [b]p2.[/b] If $a\otimes b = a^2 + b^2 + 2ab$, find $(-5\otimes 7) \otimes 4$. [b]p3.[/b] Below is a $3 \times 4$ grid. Fill each square with either $1$, $2$ or $3$. No two squares that share an edge can have the same number. After filling the grid, what is the $4$-digit number formed by the bottom row? [img]https://cdn.artofproblemsolving.com/attachments/9/6/7ef25fc1220d1342be66abc9485c4667db11c3.png[/img] [b]p4.[/b] What is the angle in degrees between the hour hand and the minute hand when the time is $6:30$? [b]p5.[/b] In a small town, there are some cars, tricycles, and spaceships. (Cars have $4$ wheels, tricycles have $3$ wheels, and spaceships have $6$ wheels.) Among the vehicles, there are $24$ total wheels. There are more cars than tricycles and more tricycles than spaceships. How many cars are there in the town? [b]p6.[/b] You toss five coins one after another. What is the probability that you never get two consecutive heads or two consecutive tails? [b]p7.[/b] In the below diagram, $\angle ABC$ and $\angle BCD$ are right angles. If $\overline{AB} = 9$, $\overline{BD} = 13$, and $\overline{CD} = 5$, calculate $\overline{AC}$. [img]https://cdn.artofproblemsolving.com/attachments/7/c/8869144e3ea528116e2d93e14a7896e5c62229.png[/img] [b]p8.[/b] Out of $100$ customers at a market, $80$ purchased oranges, $60$ purchased apples, and $70$ purchased bananas. What is the least possible number of customers who bought all three items? [b]p9.[/b] Francis, Ted and Fred planned to eat cookies after dinner. But one of them sneaked o earlier and ate the cookies all by himself. The three say the following: Francis: Fred ate the cookies. Fred: Ted did not eat the cookies. Ted: Francis is lying. If exactly one of them is telling the truth, who ate all the cookies? [b]p11.[/b] Let $ABC$ be a triangle with a right angle at $A$. Suppose $\overline{AB} = 6$ and $\overline{AC} = 8$. If $AD$ is the perpendicular from $A$ to $BC$, what is the length of $AD$? [b]p12.[/b] How many three digit even numbers are there with an even number of even digits? [b]p13.[/b] Three boys, Bob, Charles and Derek, and three girls, Alice, Elizabeth and Felicia are all standing in one line. Bob and Derek are each adjacent to precisely one girl, while Felicia is next to two boys. If Alice stands before Charles, who stands before Elizabeth, determine the number of possible ways they can stand in a line. [b]p14.[/b] A man $5$ foot, $10$ inches tall casts a $14$ foot shadow. $20$ feet behind the man, a flagpole casts ashadow that has a $9$ foot overlap with the man's shadow. How tall (in inches) is the flagpole? [b]p15.[/b] Alvin has a large bag of balls. He starts throwing away balls as follows: At each step, if he has $n$ balls and 3 divides $n$, then he throws away a third of the balls. If $3$ does not divide $n$ but $2$ divides $n$, then he throws away half of them. If neither $3$ nor $2$ divides $n$, he stops throwing away the balls. If he began with $1458$ balls, after how many steps does he stop throwing away balls? [b]p16.[/b] Oski has $50$ coins that total to a value of $82$ cents. You randomly steal one coin and find out that you took a quarter. As to not enrage Oski, you quickly put the coin back into the collection. However, you are both bored and curious and decide to randomly take another coin. What is the probability that this next coin is a penny? (Every coin is either a penny, nickel, dime or quarter). [b]p17.[/b] Let $ABC$ be a triangle. Let $M$ be the midpoint of $BC$. Suppose $\overline{MA} = \overline{MB} = \overline{MC} = 2$ and $\angle ACB = 30^o$. Find the area of the triangle. [b]p18.[/b] A spirited integer is a positive number representable in the form $20^n + 13k$ for some positive integer $n$ and any integer $k$. Determine how many spirited integers are less than $2013$. [b]p19. [/b]Circles of radii $20$ and $13$ are externally tangent at $T$. The common external tangent touches the circles at $A$, and $B$, respectively where $A \ne B$. The common internal tangent of the circles at $T$ intersects segment $AB$ at $X$. Find the length of $AX$. [b]p20.[/b] A finite set of distinct, nonnegative integers $\{a_1, ... , a_k\}$ is called admissible if the integer function $f(n) = (n + a_1) ... (n + a_k)$ has no common divisor over all terms; that is, $gcd \left(f(1), f(2),... f(n)\right) = 1$ for any integer$ n$. How many admissible sets only have members of value less than $10$? $\{4\}$ and $\{0, 2, 6\}$ are such sets, but $\{4, 9\}$ and $\{1, 3, 5\}$ are not. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

A [i]windmill[/i] is a closed line segment of unit length with a distinguished endpoint, the [i]pivot[/i]. Let $S$ be a finite set of $n$ points such that the distance between any two points of $S$ is greater than $c$. A configuration of $n$ windmills is [i]admissible[/i] if no two windmills intersect and each point of $S$ is used exactly once as a pivot. An admissible configuration of windmills is initially given to Geoff in the plane. In one operation Geoff can rotate any windmill around its pivot, either clockwise or counterclockwise and by any amount, as long as no two windmills intersect during the process. Show that Geoff can reach any other admissible configuration in finitely many operations, where (i) $c = \sqrt 3$, (ii) $c = \sqrt 2$. [i]Proposed by Michael Ren[/i]

Given a positive integer $n$, show that the set $\{1,2,...,n\}$ can be partitioned into $m$ sets, each with the same sum, if and only if m is a divisor of $\frac{n(n + 1)}{2}$ which does not exceed $\frac{n + 1}{2}$.

Given an expression $x^2 + ax + b$ where $a,b$ are integer coefficients. At any step, one can change the expression by adding either $1$ or $-1$ to only one of the two coefficients $a, b$. a) Suppose that the initial expression has $a =-7$ and $b = 19$. Show your modification steps to obtain a new expression that has zero value at some integer value of $x$. b) Starting from the initial expression as above, one gets the expression $x^2 - 17x + 9$ after $m$ modification steps. Prove that at a certain step $k$ with $k < m$, the obtained expression has zero value at some integer value of $x$.

Do there exist 2018 positive irreducible fractions, each with a different denominator, so that the denominator of the difference of any two (after reducing the fraction) is less than the denominator of any of the initial 2018 fractions? (6 points) Maxim Didin

Let \( n \) be a positive integer. A function \( f : \{0, 1, \dots, n\} \to \{0, 1, \dots, n\} \) is called \( n \)-Bolivian if it satisfies the following conditions: • \( f(0) = 0 \); • \( f(t) \in \{ t-1, f(t-1), f(f(t-1)), \dots \} \) for all \( t = 1, 2, \dots, n \). For example, if \( n = 3 \), then the function defined by \( f(0) = f(1) = 0 \), \( f(2) = f(3) = 1 \) is 3-Bolivian, but the function defined by \( f(0) = f(1) = f(2) = 0 \), \( f(3) = 1 \) is not 3-Bolivian. For a fixed positive integer \( n \), Gollum selects an \( n \)-Bolivian function. Smeagol, knowing that \( f \) is \( n \)-Bolivian, tries to figure out which function was chosen by asking questions of the type: \[ \text{How many integers } a \text{ are there such that } f(a) = b? \] given a \( b \) of his choice. Show that if Gollum always answers correctly, Smeagol can determine \( f \) and find the minimum number of questions he needs to ask, considering all possible choices of \( f \).

Vova has a square grid $72\times 72$. Unfortunately, $n$ cells are stained with coffee. Determine if Vova always can cut out a clean square $3\times 3$ without its central cell, if a) $n=699$; b) $n=750$.

[u]Set 1[/u] [b]B1.[/b] Evaluate $2 + 0 - 2 \times 0$. [b]B2.[/b] It takes four painters four hours to paint four houses. How many hours does it take forty painters to paint forty houses? [b]B3.[/b] Let $a$ be the answer to this question. What is $\frac{1}{2-a}$? [u]Set 2[/u] [b]B4.[/b] Every day at Andover is either sunny or rainy. If today is sunny, there is a $60\%$ chance that tomorrow is sunny and a $40\%$ chance that tomorrow is rainy. On the other hand, if today is rainy, there is a $60\%$ chance that tomorrow is rainy and a $40\%$ chance that tomorrow is sunny. Given that today is sunny, the probability that the day after tomorrow is sunny can be expressed as n%, where n is a positive integer. What is $n$? [b]B5.[/b] In the diagram below, what is the value of $\angle DD'Y$ in degrees? [img]https://cdn.artofproblemsolving.com/attachments/0/8/6c966b13c840fa1885948d0e4ad598f36bee9d.png[/img] [b]B6.[/b] Christina, Jeremy, Will, and Nathan are standing in a line. In how many ways can they be arranged such that Christina is to the left of Will and Jeremy is to the left of Nathan? Note: Christina does not have to be next to Will and Jeremy does not have to be next to Nathan. For example, arranging them as Christina, Jeremy, Will, Nathan would be valid. [u]Set 3[/u] [b]B7.[/b] Let $P$ be a point on side $AB$ of square $ABCD$ with side length $8$ such that $PA = 3$. Let $Q$ be a point on side $AD$ such that $P Q \perp P C$. The area of quadrilateral $PQDB$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]B8.[/b] Jessica and Jeffrey each pick a number uniformly at random from the set $\{1, 2, 3, 4, 5\}$ (they could pick the same number). If Jessica’s number is $x$ and Jeffrey’s number is $y$, the probability that $x^y$ has a units digit of $1$ can be expressed as $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]B9.[/b] For two points $(x_1, y_1)$ and $(x_2, y_2)$ in the plane, we define the taxicab distance between them as $|x_1 - x_2| + |y_1 - y_2|$. For example, the taxicab distance between $(-1, 2)$ and $(3,\sqrt2)$ is $6-\sqrt2$. What is the largest number of points Nathan can find in the plane such that the taxicab distance between any two of the points is the same? [u]Set 4[/u] [b]B10.[/b] Will wants to insert some × symbols between the following numbers: $$1\,\,\,2\,\,\,3\,\,\,4\,\,\,6$$ to see what kinds of answers he can get. For example, here is one way he can insert $\times$ symbols: $$1 \times 23 \times 4 \times 6 = 552.$$ Will discovers that he can obtain the number $276$. What is the sum of the numbers that he multiplied together to get $276$? [b]B11.[/b] Let $ABCD$ be a parallelogram with $AB = 5$, $BC = 3$, and $\angle BAD = 60^o$ . Let the angle bisector of $\angle ADC$ meet $AC$ at $E$ and $AB$ at $F$. The length $EF$ can be expressed as $m/n$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? [b]B12.[/b] Find the sum of all positive integers $n$ such that $\lfloor \sqrt{n^2 - 2n + 19} \rfloor = n$. Note: $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$. [u]Set 5[/u] [b]B13.[/b] This year, February $29$ fell on a Saturday. What is the next year in which February $29$ will be a Saturday? [b]B14.[/b] Let $f(x) = \frac{1}{x} - 1$. Evaluate $$f\left( \frac{1}{2020}\right) \times f\left( \frac{2}{2020}\right) \times f\left( \frac{3}{2020}\right) \times \times ... \times f\left( \frac{2019}{2020}\right) .$$ [b]B15.[/b] Square $WXYZ$ is inscribed in square $ABCD$ with side length $1$ such that $W$ is on $AB$, $X$ is on $BC$, $Y$ is on $CD$, and $Z$ is on $DA$. Line $W Y$ hits $AD$ and $BC$ at points $P$ and $R$ respectively, and line $XZ$ hits $AB$ and $CD$ at points $Q$ and $S$ respectively. If the area of $WXYZ$ is $\frac{13}{18}$ , then the area of $PQRS$ can be expressed as $m/n$ for relatively prime positive integers $m$ and $n$. What is $m + n$? PS. You had better use hide for answers. Last sets have been posted [url=https://artofproblemsolving.com/community/c4h2777424p24371574]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A $8 \times 8$ board is given, with sides directed north-south and east-west. It is divided into $1 \times 1$ cells in the usual manner. In each cell, there is most one [i]house[/i]. A house occupies only one cell. A house is [i] in the shade[/i] if there is a house in each of the cells in the south, east and west sides of its cell. In particular, no house placed on the south, east or west side of the board is in the shade. Find the maximal number of houses that can be placed on the board such that no house is in the shade.

Find all numbers $n \in \mathbb{N}^*$ for which there exists a finite set of natural numbers $A=(a_1, a_2,...a_n)$ so that for any $k$ $(1\leq k \leq n)$ the number $a_k$ is the number of all multiples of $k$ in set $A$.

Determine the largest $k$ such that for all competitive graph with $2019$ points, if the difference between in-degree and out-degree of any point is less than or equal to $k$, then this graph is strongly connected.

7. There are 100 chess bishops on white squares of a $100 \times 100$ chess board. Some of them are white and some of them are black. They can move in any order and capture the bishops of opposing color. What number of moves is sufficient for sure to retain only one bishop on the chess board?

Some points with integer coordinates in the plane are marked. It is known that no four of them lie on a circle. Show that there exists a circle of radius 1995 without any marked points inside. (AV Shapovelov)

A circle is divided in $100$ equal parts and the points of this division are colored green or yellow, such that when between two points of division $A,B$ there are exactly $4$ division points and the point $A$ is green, then the point $B$ shall be yellow. Which points are more, the green or the yellow ones?

Find the number of subsets of the set $\{1,2,3,...,5n\}$ such that the sum of the elements in each subset are divisible by $5$.

In the plan $6$ points were located such that the distance between two damages of them is greater than or equal to $1$. Prove that it is possible to choose two of those points such that their distance is greater than or equal to $2 \cos{18}$ Observation: It might help you to know that $\cos{18} = 0.95105\ldots$ and $\cos{24} = 0.91354\ldots$

Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. [i]Proposed by Finland[/i]

Let $S$ be a finite set of points in the plane, such that for each $2$ points $A$ and $B$ in $S$, the segment $AB$ is a side of a regular polygon all of whose vertices are contained in $S$. Find all possible values for the number of elements of $S$. Proposed by [i]Viktor Simjanoski, Macedonia[/i]

A necklace consists of 100 blue and several red beads. It is known that every segment of the necklace containing 8 blue beads contain also at least 5 red beads. What minimum number of red beads can be in the necklace? [i]Proposed by A. Golovanov[/i]