A manager of a company has 8 workers. One day, he holds a few meetings. (1)Each meeting lasts 1 hour, no break between two meetings. (2)Three workers attend each meeting. (3)Any two workers have attended at least one common meeting. (4)Any worker cannot leave until he finishes all his meetings. Then, how long does the worker who works the longest work at least?

Consider a matrix of size $n\times n$ whose entries are real numbers of absolute value not exceeding $1$. The sum of all entries of the matrix is $0$. Let $n$ be an even positive integer. Determine the least number $C$ such that every such matrix necessarily has a row or a column with the sum of its entries not exceeding $C$ in absolute value. [i]Proposed by Marcin Kuczma, Poland[/i]

Suppose $100$ points in the plane are coloured using two colours, red and white such that each red point is the centre of circle passing through at least three white points. What is the least possible number of white points?

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]

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

Consider a $1 \times n$ rectangle and some tiles of size $1 \times 1$ of four different colours. The rectangle is tiled in such a way that no two neighboring square tiles have the same colour. a) Find the number of distinct symmetrical tilings. b) Find the number of tilings such that any consecutive square tiles have distinct colours.

For each positive integer $n$, define $s(n) =\sum_{k=0}^n r_k$, where $r_k$ is the remainder when $n \choose k$ is divided by $3$. Find all positive integers $n$ such that $s(n) \ge n$. Malik Talbi

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]

There are 100 visually identical coins of three types: golden, silver and copper. There is at least one coin of each type. Each golden coin weighs 3 grams, each silver coins weighs 2 grams and each copper coin weighs 1 gram. How to find the type of each coin performing no more than 101 measurements on a balance scale with no weights.

Let $ABCDEF$ be a hexagon. Sides and diagonals of hexagon are colored in two colors: blue and yellow. Prove that there exist a triangle with vertices from set $\{A,B,C,D,E,F\}$ which sides are all same colour

A positive integer $k$ is given. Initially, $N$ cells are marked on an infinite checkered plane. We say that the cross of a cell $A$ is the set of all cells lying in the same row or in the same column as $A$. By a turn, it is allowed to mark an unmarked cell $A$ if the cross of $A$ contains at least $k$ marked cells. It appears that every cell can be marked in a sequence of such turns. Determine the smallest possible value of $N$.

Find maximal numbers of planes, such there are $6$ points and 1) $4$ or more points lies on every plane. 2) No one line passes through $4$ points.

Given positive integers $k, m, n$ such that $1 \leq k \leq m \leq n$. Evaluate \[\sum^{n}_{i=0} \frac{(-1)^i}{n+k+i} \cdot \frac{(m+n+i)!}{i!(n-i)!(m+i)!}.\]

Initially, all the squares of an $8\times 8$ grid are white. You start by choosing one of the squares and coloring it gray. After that, you may color additional squares gray one at a time, but you may only color a square gray if it has exactly $1$ or $3$ gray neighbors at that moment (where a neighbor is a square sharing an edge). For example, the configuration below (of a smaller $3\times 4$ grid) shows a situation where six squares have been colored gray so far. The squares that can be colored at the next step are marked with a dot. Is it possible to color all the squares gray? Justify your answer. [img]https://cdn.artofproblemsolving.com/attachments/1/c/d50ab269f481e4e516dace06a991e6b37f2a85.png[/img]

Fifty students take part in a mathematical competition where a set of $8$ problems is given (same set to each participant). The final result showed that a total of $171$ correct solutions were obtained. Prove that there are $3$ of the given problems that have been correctly solved by the same $3$ students.

Let $G$ be a graph whose vertices are the integers. Assume that any two integers are connected by a finite path in $G$. For two integers $x$ and $y$, we denote by $d(x, y)$ the length of the shortest path from $x$ to $y$, where the length of a path is the number of edges in it. Assume that $d(x, y) \mid x-y$ for all integers $x, y$ and define $S(G)=\{d(x, y) | x, y \in \mathbb{Z}\}$. Find all possible sets $S(G)$.

Regular $n$-gon is divided to triangles using $n-3$ diagonals of which none of them have common points with another inside polygon. How much among this triangles can there be the most not congruent? [i]Proposed by Dusan Djukic[/i]

In some cells of a rectangular table $m\times n (m, n> 1)$ is one checker. $Baby$ cut along the lines of the grid this table so that it is split into two equal parts, with the number of pieces on each side were the same. $Carlson$ changed the arrangement of checkers on the board (and on each side of the cage is still worth no more than one pieces). Prove that the $Baby$ may again cut the board into two equal parts containing an equal number of pieces

Let $R$ be an $20 \times 18$ grid of points such that adjacent points are $1$ unit apart. A fly starts at a point and jumps in straight lines to other points in $R$ in turn, such that each point in R is visited exactly once and no two jumps intersect at a point other than an endpoint of a jump, for a total of $359$ jumps. Call a jump small if it is of length $1$. What is the least number of small jumps? (The left configuration for a $4 \times 4$ grid has $9$ small jumps and $15$ total jumps, while the right configuration is invalid.)

Janez wants to make an $m\times n$ grid (consisting of unit squares) using equal elements of the form $\llcorner$, where each leg of an element has the unit length. No two elements can overlap. For which values of $m$ and $n$ can Janez do the task?

Prove that for every positive integer $n$ there exists a (not necessarily convex) polygon with no three collinear vertices, which admits exactly $n$ diffferent triangulations. (A [i]triangulation[/i] is a dissection of the polygon into triangles by interior diagonals which have no common interior points with each other nor with the sides of the polygon)

We have a stick of length $2n{}$ and a machine which cuts sticks of length $k\in\mathbb{N}$ with $k>1$ into two sticks with arbitrary positive integer lengths. What is the smallest number of cuts after which we can always find some sticks whose lengths sum up to $n{}$?

Consider a ping-pong match between two teams, each consisting of $1000$ players. Each player played against each player of the other team exactly once (there are no draws in ping-pong). Prove that there exist ten players, all from the same team, such that every member of the other team has lost his game against at least one of those ten players.

a) Let $n$ $(n \geq 2)$ be an integer. On a line there are $n$ distinct (pairwise distinct) sets of points, such that for every integer $k$ $(1 \leq k \leq n)$ the union of every $k$ sets contains exactly $k+1$ points. Show that there is always a point that belongs to every set. b) Is the same conclusion true if there is an infinity of distinct sets of points such that for every positive integer $k$ the union of every $k$ sets contains exactly $k+1$ points?

A [i]string of parentheses[/i] is any word that can be composed by the following rules. 1) () is a string of parentheses. 2) If $s$ is a string of parentheses then $(s)$ is a string of parentheses. 3) If $s$ and t are strings of parentheses then $st$ is a string of parentheses. The [i]midcode [/i] of a string of parentheses is the tuple of natural numbers obtained by finding, for all pairs of opening and its corresponding closing parenthesis, the number of characters remaining to the left from the medium position between these parentheses, and writing all these numbers in non-decreasing order. For example, the midcode of $(())$ is $(2,2)$ and the midcode of ()() is $(1,3)$. Prove that midcodes of arbitrary two different strings of parentheses are different.