We are given $3n$ points $A_1,A_2, \ldots , A_{3n}$ in the plane, no three of them collinear. Prove that one can construct $n$ disjoint triangles with vertices at the points $A_i.$

Show that the product of every $k$ consecutive members of the Fibonacci sequence is divisible by $f_1f_2\ldots f_k$ (where $f_0=0$ and $f_1=1$).

In the City of Islands there are $2021$ islands connected by bridges. For any given pair of islands $A$ and $B$, one can go from island $A$ to island $B$ using the bridges. Moreover, for any four islands $A_1, A_2, A_3$ and $A_4$: if there is a bridge from $A_i$ to $A_{i+1}$ for each $i \in \left \{ 1,2,3 \right \}$, then there is a bridge between $A_{j}$ and $A_{k}$ for some $j,k \in \left \{ 1,2,3,4 \right \}$ with $|j-k|=2$. Show that there is at least one island which is connected to any other island by a bridge.

There are $15$ people attending math team: $12$ students and $3$ captains. One of the captains brings $33$ identical snacks. A nonnegative number of names (students and/or captains) are written on the NO SNACK LIST. At the end of math team, all students each get n snacks, and all captains get $n +1$ snacks, unless the person’s name is written on the board. After everyone’s snacks are distributed, there are none left. Find the number of possible integer values of $n$.

Adam has a box with $15$ pool balls in it, numbered from $1$ to $15$, and picks out $5$ of them. He then sorts them in increasing order, takes the four differences between each pair of adjacent balls, and finds exactly two of these differences are equal to $1$. How many selections of $5$ balls could he have drawn from the box? [i]Proposed by Adam Bertelli[/i]

Initially, there are $n$ red boxes numbered with the numbers $1,2,\dots ,n$ and $n$ white boxes numbered with the numbers $1,2,\dots ,n$ on the table. At every move, we choose $2$ different colored boxes and put a ball on each of them. After some moves, every pair of the same numbered boxes has the property of either the number of balls from the red one is $6$ more than the number of balls from the white one or the number of balls from the white one is $16$ more than the number of balls from the red one. With that given information find all possible values of $n$

Ten boxes are arranged in a circle. Each box initially contains a positive number of golf balls. A move consists of taking all of the golf balls from one of the boxes and placing them into the boxes that follow it in a counterclockwise direction, putting one ball into each box. Prove that if the next move always starts with the box where the last ball of the previous move was placed, then after some number of moves, we get back to the initial distribution of golf balls in the boxes.

A table has $m$ rows and $n$ columns. The following permutations of its $mn$ elements are permitted: an arbitrary permutation leaving each element in the same row (a“horizontal move”) and an arbitrary permutation leaving each element in the same column (a “vertical move”). Find the number $k$ such that any permutation of $mn$ elements can be obtained by $k$ permitted moves but there exists a permutation that cannot be achieved in less than $k$ moves. (A Andjans, Riga0

Some cities in country are connected with oneway road. It is known that every closed cyclic route, that don`t break traffic laws, consists of even roads. Prove that king of city can place military bases in some cities such that there are not roads between these cities, but for every city without base we can go from city with base by no more than $1$ road. [hide=PS]I think it should be one more condition, like there is cycle that connect all cities [/hide]

On a party with $99$ guests, hosts Ann and Bob play a game (the hosts are not regarded as guests). There are $99$ chairs arranged in a circle; initially, all guests hang around those chairs. The hosts take turns alternately. By a turn, a host orders any standing guest to sit on an unoccupied chair $c$. If some chair adjacent to $c$ is already occupied, the same host orders one guest on such chair to stand up (if both chairs adjacent to $c$ are occupied, the host chooses exactly one of them). All orders are carried out immediately. Ann makes the first move; her goal is to fulfill, after some move of hers, that at least $k$ chairs are occupied. Determine the largest $k$ for which Ann can reach the goal, regardless of Bob's play.

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

[b]p1.[/b] For positive real numbers $x, y$, the operation $\otimes$ is given by $x \otimes y =\sqrt{x^2 - y}$ and the operation $\oplus$ is given by $x \oplus y =\sqrt{x^2 + y}$. Compute $(((5\otimes 4)\oplus 3)\otimes2)\oplus 1$. [b]p2.[/b] Janabel is cutting up a pizza for a party. She knows there will either be $4$, $5$, or $6$ people at the party including herself, but can’t remember which. What is the least number of slices Janabel can cut her pizza to guarantee that everyone at the party will be able to eat an equal number of slices? [b]p3.[/b] If the numerator of a certain fraction is added to the numerator and the denominator, the result is $\frac{20}{19}$ . What is the fraction? [b]p4.[/b] Let trapezoid $ABCD$ be such that $AB \parallel CD$. Additionally, $AC = AD = 5$, $CD = 6$, and $AB = 3$. Find $BC$. [b]p5.[/b] AtMerrick’s Ice Cream Parlor, customers can order one of three flavors of ice cream and can have their ice cream in either a cup or a cone. Additionally, customers can choose any combination of the following three toppings: sprinkles, fudge, and cherries. How many ways are there to buy ice cream? [b]p6.[/b] Find the minimum possible value of the expression $|x+1|+|x-4|+|x-6|$. [b]p7.[/b] How many $3$ digit numbers have an even number of even digits? [b]p8.[/b] Given that the number $1a99b67$ is divisible by $7$, $9$, and $11$, what are $a$ and $b$? Express your answer as an ordered pair. [b]p9.[/b] Let $O$ be the center of a quarter circle with radius $1$ and arc $AB$ be the quarter of the circle’s circumference. Let $M$,$N$ be the midpoints of $AO$ and $BO$, respectively. Let $X$ be the intersection of $AN$ and $BM$. Find the area of the region enclosed by arc $AB$, $AX$,$BX$. [b]p10.[/b] Each square of a $5$-by-$1$ grid of squares is labeled with a digit between $0$ and $9$, inclusive, such that the sum of the numbers on any two adjacent squares is divisible by $3$. How many such labelings are possible if each digit can be used more than once? [b]p11.[/b] A two-digit number has the property that the difference between the number and the sum of its digits is divisible by the units digit. If the tens digit is $5$, how many different possible values of the units digit are there? [b]p12.[/b] There are $2019$ red balls and $2019$ white balls in a jar. One ball is drawn and replaced with a ball of the other color. The jar is then shaken and one ball is chosen. What is the probability that this ball is red? [b]p13.[/b] Let $ABCD$ be a square with side length $2$. Let $\ell$ denote the line perpendicular to diagonal $AC$ through point $C$, and let $E$ and $F$ be themidpoints of segments $BC$ and $CD$, respectively. Let lines $AE$ and $AF$ meet $\ell$ at points $X$ and $Y$ , respectively. Compute the area of $\vartriangle AXY$ . [b]p14.[/b] Express $\sqrt{21-6\sqrt6}+\sqrt{21+6\sqrt6}$ in simplest radical form. [b]p15.[/b] Let $\vartriangle ABC$ be an equilateral triangle with side length two. Let $D$ and $E$ be on $AB$ and $AC$ respectively such that $\angle ABE =\angle ACD = 15^o$. Find the length of $DE$. [b]p16.[/b] $2018$ ants walk on a line that is $1$ inch long. At integer time $t$ seconds, the ant with label $1 \le t \le 2018$ enters on the left side of the line and walks among the line at a speed of $\frac{1}{t}$ inches per second, until it reaches the right end and walks off. Determine the number of ants on the line when $t = 2019$ seconds. [b]p17.[/b] Determine the number of ordered tuples $(a_1,a_2,... ,a_5)$ of positive integers that satisfy $a_1 \le a_2 \le ... \le a_5 \le 5$. [b]p18.[/b] Find the sum of all positive integer values of $k$ for which the equation $$\gcd (n^2 -n -2019,n +1) = k$$ has a positive integer solution for $n$. [b]p19.[/b] Let $a_0 = 2$, $b_0 = 1$, and for $n \ge 0$, let $$a_{n+1} = 2a_n +b_n +1,$$ $$b_{n+1} = a_n +2b_n +1.$$ Find the remainder when $a_{2019}$ is divided by $100$. [b]p20.[/b] In $\vartriangle ABC$, let $AD$ be the angle bisector of $\angle BAC$ such that $D$ is on segment $BC$. Let $T$ be the intersection of ray $\overrightarrow{CB}$ and the line tangent to the circumcircle of $\vartriangle ABC$ at $A$. Given that $BD = 2$ and $TC = 10$, find the length of $AT$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

There are 2018 points marked on a sphere. A zebra wants to paint each point white or black and, perhaps, connect some pairs of points of different colors with a segment. Find the residue modulo 5 of the number of ways to do this.

In the country of Sikinia there are finitely many cities. From each city, exactly three roads go out and each road goes to another Sikinian city. A tourist starts a trip from city $A$ and drives according to the following rule: he turns left at the first city, then right at the next city, and so on, alternately. Show that he will eventually return to $A.$

Let $n\ge 2$ be an integer. Elwyn is given an $n\times n$ table filled with real numbers (each cell of the table contains exactly one number). We define a [i]rook set[/i] as a set of $n$ cells of the table situated in $n$ distinct rows as well as in n distinct columns. Assume that, for every rook set, the sum of $n$ numbers in the cells forming the set is nonnegative.\\ \\ By a move, Elwyn chooses a row, a column, and a real number $a,$ and then he adds $a$ to each number in the chosen row, and subtracts $a$ from each number in the chosen column (thus, the number at the intersection of the chosen row and column does not change). Prove that Elwyn can perform a sequence of moves so that all numbers in the table become nonnegative.

$ 5 $ points are situated in the plane so that any three of them form a triangle of area at most $ 1. $ Prove that there is a trapezoid of area at most $ 3 $ which contains all these points ('including' here means that the points can also be on the sides of the trapezoid).

An $8\times8$ chessboard is completely tiled by $2\times1$ dominoes. Prove that there exist a king's tour of that chessboard such that every cell of the board is visited exactly once and such that king goes domino by domino, i.e. if king moves to the first cell of a domino, it must move to another cell in the next move. (King doesn't have to come back to the initial cell. King is an usual chess piece.)

The director has found out that six conspiracies have been set up in his department, each of them involving exactly $3$ persons. Prove that the director can split the department in two laboratories so that none of the conspirative groups is entirely in the same laboratory.

Let $n$ be a positive integer. There are $n$ islands with $n-1$ bridges connecting them such that one can travel from any island to another. One afternoon, a fire breaks out in one of the islands. Every morning, it spreads to all neighbouring islands. (Two islands are neighbours if they are connected by a bridge.) To control the spread, one bridge is destroyed every night until the fire has nowhere to spread the next day. Let $X$ be the minimum possible number of bridges one has to destroy before the fire stops spreading. Find the maximum possible value of $X$ over all possible configurations of bridges and island where the fire starts at.

Determine all pairs of natural numbers $(m, r)$ with $2014 \ge m \ge r \ge 1$ that fulfill $\binom{2014}{m}+\binom{m}{r}=\binom{2014}{r}+\binom{2014-r}{m-r} $

Let $\sigma : \{1, 2, . . . , n\} \to \{1, 2, . . . , n\}$ be a bijective mapping. Let $S_n$ be the set of all such mappings and let $d_k(\sigma) = |\sigma(k) - \sigma(k + 1)|$, for all $k \in \{1, 2, ..., n\}$, where $\sigma (n + 1) = \sigma (1)$. Also let $d(\sigma) = \min \{d_k(\sigma) | 1 \le k \le n\}$. Find $\max_{\sigma \in S_n} d(\sigma)$.

Let $n$ be a fixed positive integer. Ben is playing a computer game. The computer picks a tree $T$ such that no vertex of $T$ has degree $2$ and such that $T$ has exactly $n$ leaves, labeled $v_1,\ldots, v_n$. The computer then puts an integer weight on each edge of $T$, and shows Ben neither the tree $T$ nor the weights. Ben can ask queries by specifying two integers $1\leq i < j \leq n$, and the computer will return the sum of the weights on the path from $v_i$ to $v_j$. At any point, Ben can guess whether the tree's weights are all zero. He wins the game if he is correct, and loses if he is incorrect. (a) Show that if Ben asks all $\binom n2$ possible queries, then he can guarantee victory. (b) Does Ben have a strategy to guarantee victory in less than $\binom n2$ queries? [i]Brandon Wang[/i]

Let $(m,n)$ be a pair of positive integers. (a) Prove that the set of all positive integers can be partitioned into four pairwise disjoint nonempty subsets such that none of them has two numbers with absolute value of their difference equal to either $m$, $n$, or $m+n$. (b) Find all pairs $(m,n)$ such that the set of all positive integers can not be partitioned into three pairwise disjoint nonempty subsets satisfying the above condition.

A planar country has an odd number of cities separated by pairwise distinct distances. Some of these cities are connected by direct two-way flights. Each city is directly connected to exactly two ther cities, and the latter are located farthest from it. Prove that, using these flights, one may go from any city to any other city