Several guests at a round table are eating from a basket containing $2011$ berries. Going in clockwise direction, each guest has eaten either twice as many berries as or six fewer berries than the next guest. Prove that not all the berries have been eaten.

You are given $20$ weights such that any object of integer weight $m$, $1 \le m \le1997$, can be balanced by placing it on one pan of a balance and a subset of the weights on the other pan. What is the minimal value of largest of the $20$ weights if the weights are (a) all integers; (b) not necessarily integers? (M Rasin)

In a circumference there are $99$ natural numbers. If $a$ and $b$ are two consecutive numbers in the circle, then they must satisfies one of the following conditions: $a-b=1, a-b=2$ or $\frac{a}{b}=2$. Prove that, in the circle exists a number multiple of $3$.

a) Calculate the product $$\left(1+\frac{1}{2}\right) \left(1+\frac{1}{3}\right) \left(1+\frac{1}{4}\right)... \left(1+\frac{1}{2006}\right) \left(1+\frac{1}{2007}\right)$$ b) Let the set $$A =\left\{\frac{1}{2}, \frac{1}{3},\frac{1}{4}, ...,\frac{1}{2006}, \frac{1}{2007}\right\}$$ Determine the sum of all products of $2$, of $4$, of $6$,... , of $2004$ ¸and of $ 2006$ different elements of the set $A$.

Evan is a $n$-dimensional being that lives in a house formed by the points of $\mathbb{Z}_{\geq 0}^n$. His room is the set of points in which coordinates are all less than or equal to $2021$. Evan's room has been infested with bees, so he decides to flush them out through $\textit{captures}$. A $\textit{capture}$ can be performed by eliminating a bee from point $ (a_1, a_2, \ldots, a_n) $ and replacing it with $ n $ bees, one in each of the points: $$ (a_1 + 1, a_2 , \ldots, a_n), (a_1, a_2 + 1, \ldots, a_n), \ldots, (a_1, a_2, \ldots, a_n + 1) $$ However, two bees can never occupy the same point in the house. Determine, for every $ n $, the greatest value $ A (n) $ of bees such that, for some initial arrangement of these bees in Evan's room, he is able to accomplish his goal with a finite amount of $\textit{captures}$.

There are $20$ points in the plane and no three of them are collinear. Of these points $10$ are red while the other $10$ are blue. Prove that there exists a straight line such that there are $5$ red points and $5$ blue points on either side of this line. (A Kushnirenko, Moscow)

A figure with area $1$ is cut out of paper. We divide this figure into $10$ parts and color them in $10$ different colors. Now, we turn around the piece of paper, divide the same figure on the other side of the paper in $10$ parts again (in some different way). Show that we can color these new parts in the same $10$ colors again (hereby, different parts should have different colors) such that the sum of the areas of all parts of the figure colored with the same color on both sides is $\geq \frac{1}{10}.$

[b]p1.[/b] Sujay sees a shooting star go across the night sky, and took a picture of it. The shooting star consists of a star body, which is bounded by four quarter-circle arcs, and a triangular tail. Suppose $AB = 2$, $AC = 4$. Let the area of the shooting star be $X$. If $6X = a-b\pi$ for positive integers $a, b$, find $a + b$. [img]https://cdn.artofproblemsolving.com/attachments/0/f/f9c9ff23416565760df225c133330e795b9076.png[/img] [b]p2.[/b] Assuming that each distinct arrangement of the letters in $DISCUSSIONS$ is equally likely to occur, what is the probability that a random arrangement of the letters in $DISCUSSIONS$ has all the $S$’s together? [b]p3.[/b] Evaluate $$\frac{(1 + 2022)(1 + 2022^2)(1 + 2022^4) ... (1 + 2022^{2^{2022}})}{1 + 2022 + 2022^2 + ... + 2022^{2^{2023}-1}} .$$ [b]p4.[/b] Dr. Kraines has $27$ unit cubes, each of which has one side painted red while the other five are white. If he assembles his cubes into one $3 \times 3 \times 3$ cube by placing each unit cube in a random orientation, what is the probability that the entire surface of the cube will be white, with no red faces visible? If the answer is $2^a3^b5^c$ for integers $a$, $b$, $c$, find $|a + b + c|$. [b]p5.[/b] Let S be a subset of $\{1, 2, 3, ... , 1000, 1001\}$ such that no two elements of $S$ have a difference of $4$ or $7$. What is the largest number of elements $S$ can have? [b]p6.[/b] George writes the number $1$. At each iteration, he removes the number $x$ written and instead writes either $4x+1$ or $8x+1$. He does this until $x > 1000$, after which the game ends. What is the minimum possible value of the last number George writes? [b]p7.[/b] List all positive integer ordered pairs $(a, b)$ satisfying $a^4 + 4b^4 = 281 \cdot 61$. [b]p8.[/b] Karthik the farmer is trying to protect his crops from a wildfire. Karthik’s land is a $5 \times 6$ rectangle divided into $30$ smaller square plots. The $5$ plots on the left edge contain fire, the $5$ plots on the right edge contain blueberry trees, and the other $5 \times 4$ plots of land contain banana bushes. Fire will repeatedly spread to all squares with bushes or trees that share a side with a square with fire. How many ways can Karthik replace $5$ of his $20$ plots of banana bushes with firebreaks so that fire will not consume any of his prized blueberry trees? [b]p9.[/b] Find $a_0 \in R$ such that the sequence $\{a_n\}^{\infty}_{n=0}$ defined by $a_{n+1} = -3a_n + 2^n$ is strictly increasing. [b]p10.[/b] Jonathan is playing with his life savings. He lines up a penny, nickel, dime, quarter, and half-dollar from left to right. At each step, Jonathan takes the leftmost coin at position $1$ and uniformly chooses a position $2 \le k \le 5$. He then moves the coin to position $k$, shifting all coins at positions $2$ through $k$ leftward. What is the expected number of steps it takes for the half-dollar to leave and subsequently return to position $5$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the set $S$ with minimal number of points defining $7$ distinct lines

The plane shows $2020$ straight lines in general position, that is, there are none three intersecting at one point but no two parallel. Let's say, that the drawn line $a$ [i]detaches [/i] the drawn line $b$ if all intersection points of line $b$ with the other drawn lines lie in one half plane wrt to line $a$ (given the most straightforward $a$). Prove that you can be guaranteed find two drawn lines $a$ and $b$ that $a$ detaches $b$, but $b$ does not detach $a$.

In a culturing of bacteria, there are two species of them: red and blue bacteria. When two red bacteria meet, they transform into one blue bacterium. When two blue bacteria meet, they transform into four red bacteria. When a red and a blue bacteria meet, they transform into three red bacteria. Find, in function of the amount of blue bacteria and the red bacteria initially in the culturing, all possible amounts of bacteria, and for every possible amount, the possible amounts of red and blue bacteria.

What is the smallest number of disks radius $\frac12$ that can cover a disk radius $1$?

The following figure shows a $3^2 \times 3^2$ grid divided into $3^2$ subgrids of size $3 \times 3$. This grid has $81$ cells, $9$ in each subgrid. [asy] draw((0,0)--(9,0)--(9,9)--(0,9)--cycle, linewidth(2)); draw((0,1)--(9,1)); draw((0,2)--(9,2)); draw((0,3)--(9,3), linewidth(2)); draw((0,4)--(9,4)); draw((0,5)--(9,5)); draw((0,6)--(9,6), linewidth(2)); draw((0,7)--(9,7)); draw((0,8)--(9,8)); draw((1,0)--(1,9)); draw((2,0)--(2,9)); draw((3,0)--(3,9), linewidth(2)); draw((4,0)--(4,9)); draw((5,0)--(5,9)); draw((6,0)--(6,9), linewidth(2)); draw((7,0)--(7,9)); draw((8,0)--(8,9)); [/asy] Now consider an $n^2 \times n^2$ grid divided into $n^2$ subgrids of size $n \times n$. Find the number of ways in which you can select $n^2$ cells from this grid such that there is exactly one cell coming from each subgrid, one from each row and one from each column.

p1. Four kite-shaped shapes as shown below ($a > b$, $a$ and $b$ are natural numbers less than $10$) arranged in such a way so that it forms a square with holes in the middle. The square hole in the middle has a perimeter of $16$ units of length. What is the possible perimeter of the outermost square formed if it is also known that $a$ and $b$ are numbers coprime? [img]https://cdn.artofproblemsolving.com/attachments/4/1/fa95f5f557aa0ca5afb9584d5cee74743dcb10.png[/img] p2. If $a = 3^p$, $b = 3^q$, $c = 3^r$, and $d = 3^s$ and if $p, q, r$, and $s$ are natural numbers, what is the smallest value of $p\cdot q\cdot r\cdot s$ that satisfies $a^2 + b^3 + c^5 = d^7$ 3. Ucok intends to compose a key code (password) consisting of 8 numbers and meet the following conditions: i. The numbers used are $1, 2, 3, 4, 5, 6, 7, 8$, and $9$. ii. The first number used is at least $1$, the second number is at least $2$, third digit-at least $3$, and so on. iii. The same number can be used multiple times. a) How many different passwords can Ucok compose? b) How many different passwords can Ucok make, if provision (iii) is replaced with: no numbers may be used more than once. p 4. For any integer $a, b$, and $c$ applies $a\times (b + c) = (a\times b) + (a\times c)$. a) Look for examples that show that $a + (b\times c)\ne (a + b)\times (a + c)$. b) Is it always true that $a + (b\times c) = (a + b)\times(a + c)$? Justify your answer. p5. The results of a survey of $N$ people with the question whether they maintain dogs, birds, or cats at home are as follows: $50$ people keep birds, $61$ people don't have dogs, $13$ people don't keep a cat, and there are at least $74$ people who keep the most a little two kinds of animals in the house. What is the maximum value and minimum of possible value of $N$ ?

A $n \times n$ matrix is filled with non-negative real numbers such that on each line and column the sum of the elements is $1$. Prove that one can choose n positive entries from the matrix, such that each of them lies on a different line and different column.

We want to place $2012$ pockets, including variously colored balls, into $k$ boxes such that [b]i)[/b] For any box, all pockets in this box must include a ball with the same color or [b]ii)[/b] For any box, all pockets in this box must include a ball having a color which is not included in any other pocket in this box Find the smallest value of $k$ for which we can always do this placement whatever the number of balls in the pockets and whatever the colors of balls.

There is a circle which is 1 meter in circumference and a point marked on it. Two cockroaches start running in the same direction from the marked point with different speeds. Whenever the fast one would catch up with the slow one, the slow one would instantly turn around and start running in tho other direction with the same speed. Whenever they would meet face-to-face, the fast one would instantly turn around and start running in tho other direction with the same speed. How far from the marked point could their 100th meeting be?

[i]20 problems for 25 minutes.[/i] [b]p1.[/b] Given that $a + 19b = 3$ and $a + 1019b = 5$, what is $a + 2019b$? [b]p2.[/b] How many multiples of $3$ are there between $2019$ and $2119$, inclusive? [b]p3.[/b] What is the maximum number of quadrilaterals a $12$-sided regular polygon can be quadrangulated into? Here quadrangulate means to cut the polygon along lines from vertex to vertex, none of which intersect inside the polygon, to form pieces which all have exactly $4$ sides. [b]p4.[/b] What is the value of $|2\pi - 7| + |2\pi - 6|$, rounded to the nearest hundredth? [b]p5.[/b] In the town of EMCCxeter, there is a $30\%$ chance that it will snow on Saturday, and independently, a $40\%$ chance that it will snow on Sunday. What is the probability that it snows exactly once that weekend, as a percentage? [b]p6.[/b] Define $n!$ to be the product of all integers between $1$ and $n$ inclusive. Compute $\frac{2019!}{2017!} \times \frac{2016!}{2018!}$ . [b]p7.[/b] There are $2019$ people standing in a row, and they are given positions $1$, $2$, $3$, $...$, $2019$ from left to right. Next, everyone in an odd position simultaneously leaves the row, and the remaining people are assigned new positions from $1$ to $1009$, again from left to right. This process is then repeated until one person remains. What was this person's original position? [b]p8.[/b] The product $1234\times 4321$ contains exactly one digit not in the set $\{1, 2, 3, 4\}$. What is this digit? [b]p9.[/b] A quadrilateral with positive area has four integer side lengths, with shortest side $1$ and longest side $9$. How many possible perimeters can this quadrilateral have? [b]p10.[/b] Define $s(n)$ to be the sum of the digits of $n$ when expressed in base $10$, and let $\gamma (n)$ be the sum of $s(d)$ over all natural number divisors $d$ of $n$. For instance, $n = 11$ has two divisors, $1$ and $11$, so $\gamma (11) = s(1) + s(11) = 1 + (1 + 1) = 3$. Find the value of $\gamma (2019)$. [b]p11.[/b] How many five-digit positive integers are divisible by $9$ and have $3$ as the tens digit? [b]p12.[/b] Adam owns a large rectangular block of cheese, that has a square base of side length $15$ inches, and a height of $4$ inches. He wants to remove a cylindrical cheese chunk of height $4$, by making a circular hole that goes through the top and bottom faces, but he wants the surface area of the leftover cheese block to be the same as before. What should the diameter of his hole be, in inches? [i]Αddendum on 1/26/19: the hole must have non-zero diameter. [/i] [b]p13.[/b] Find the smallest prime that does not divide $20! + 19! + 2019!$. [b]p14.[/b] Convex pentagon $ABCDE$ has angles $\angle ABC = \angle BCD = \angle DEA = \angle EAB$ and angle $\angle CDE = 60^o$. Given that $BC = 3$, $CD = 4$, and $DE = 5$, find $EA$. [i]Addendum on 1/26/19: ABCDE is specified to be convex. [/i] [b]p15.[/b] Sophia has $3$ pairs of red socks, $4$ pairs of blue socks, and $5$ pairs of green socks. She picks out two individual socks at random: what is the probability she gets a pair with matching color? [b]p16.[/b] How many real roots does the function $f(x) = 2019^x - 2019x - 2019$ have? [b]p17.[/b] A $30-60-90$ triangle is placed on a coordinate plane with its short leg of length $6$ along the $x$-axis, and its long leg along the $y$-axis. It is then rotated $90$ degrees counterclockwise, so that the short leg now lies along the $y$-axis and long leg along the $x$-axis. What is the total area swept out by the triangle during this rotation? [b]p18.[/b] Find the number of ways to color the unit cells of a $2\times 4$ grid in four colors such that all four colors are used and every cell shares an edge with another cell of the same color. [b]p19.[/b] Triangle $\vartriangle ABC$ has centroid $G$, and $X, Y,Z$ are the centroids of triangles $\vartriangle BCG$, $\vartriangle ACG$, and $\vartriangle ABG$, respectively. Furthermore, for some points $D,E, F$, vertices $A,B,C$ are themselves the centroids of triangles $\vartriangle DBC$, $\vartriangle ECA$, and $\vartriangle FAB$, respectively. If the area of $\vartriangle XY Z = 7$, what is the area of $\vartriangle DEF$? [b]p20.[/b] Fhomas orders three $2$-gallon jugs of milk from EMCCBay for his breakfast omelette. However, every jug is actually shipped with a random amount of milk (not necessarily an integer), uniformly distributed between $0$ and $2$ gallons. If Fhomas needs $2$ gallons of milk for his breakfast omelette, what is the probability he will receive enough milk? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider decompositions of an $8\times 8$ chessboard into $p$ non-overlapping rectangles subject to the following conditions: (i) Each rectangle has as many white squares as black squares. (ii) If $a_i$ is the number of white squares in the $i$-th rectangle, then $a_1<a_2<\ldots <a_p$. Find the maximum value of $p$ for which such a decomposition is possible. For this value of $p$, determine all possible sequences $a_1,a_2,\ldots ,a_p$.

In an election, there are $1395$ candidates and some voters. Each voter, arranges all the candidates by the priority order. We form a directed graph with $1395$ vertices, an arrow is directed from $U$ to $V$ when the candidate $U$ is at a higher level of priority than $V$ in more than half of the votes. (otherwise, there's no edge between $U,V$) Is it possible to generate all complete directed graphs with $1395$ vertices?

Georg writes a positive integer $a$ on a blackboard. As long as there is a number on the blackboard, he does the following each day: $\bullet$ If the last digit in the number on the blackboard is less than or equal to $5$, he erases that last digit. (If there is only this digit, the blackboard thus becomes empty.) $\bullet$ Otherwise he erases the entire number and writes $9$ times the number. Can Georg choose $a$ in such a way that the blackboard never becomes empty?

A box contains $p$ white balls and $q$ black balls. Beside the box there is a pile of black balls. Two balls are taken out of the box. If they have the same color, a black ball from the pile is put into the box. If they have different colors, the white ball is put back into the box. This procedure is repeated until the last two balls are removed from the box and one last ball is put in. What is the probability that this last ball is white?

A finite non-empty set of integers is called $3$-[i]good[/i] if the sum of its elements is divisible by $3$. Find the number of $3$-good subsets of $\{0,1,2,\ldots,9\}$.

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

In the plane are given $n^2 + 1$ points, no three of which lie on a line. Each line segment connecting a pair of these points is colored by either red or blue. A [i]path [/i] of length $k$ is a sequence of $k$ segments where the end of each segment (except for the last one) is the beginning of the next one. A path is [i]simple [/i] if it does not intersect itself. Prove that there exists a monochromatic simple path of length $n$.