Prove that any triangle can be cut into $2019$ quadrilaterals such that each quadrilateral is both inscribed and circumscribed. (Nairi Sedrakyan)

A Mathlon is a competition where there are $M$ athletic events. $A, B$ and $C$ were the only participants of a Mathlon. In each event, $p_1$ points were given to the first place, $p_2$ points to the second place and $p_3$ points to third place, with $p_1> p_2> p_3> 0$ where $p_1$, $p_2$ and $p_3$ are integer numbers. The final result was $22$ points for $A$, $9$ for $B$, and $9$ for $C$. $B$ won the $100$ meter dash. Determine $M$ and who was the second in high jump.

A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit's starting point, $A_0,$ and the hunter's starting point, $B_0$ are the same. After $n-1$ rounds of the game, the rabbit is at point $A_{n-1}$ and the hunter is at point $B_{n-1}.$ In the $n^{\text{th}}$ round of the game, three things occur in order: [list=i] [*]The rabbit moves invisibly to a point $A_n$ such that the distance between $A_{n-1}$ and $A_n$ is exactly $1.$ [*]A tracking device reports a point $P_n$ to the hunter. The only guarantee provided by the tracking device to the hunter is that the distance between $P_n$ and $A_n$ is at most $1.$ [*]The hunter moves visibly to a point $B_n$ such that the distance between $B_{n-1}$ and $B_n$ is exactly $1.$ [/list] Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after $10^9$ rounds, she can ensure that the distance between her and the rabbit is at most $100?$ [i]Proposed by Gerhard Woeginger, Austria[/i]

Let $n$ be a positive integer. We are given a $2n \times 2n$ table. Each cell is coloured with one of $2n^2$ colours such that each colour is used exactly twice. Jana stands in one of the cells. There is a chocolate bar lying in one of the other cells. Jana wishes to reach the cell with the chocolate bar. At each step, she can only move in one of the following two ways. Either she walks to an adjacent cell or she teleports to the other cell with the same colour as her current cell. (Jana can move to an adjacent cell of the same colour by either walking or teleporting.) Determine whether Jana can fulfill her wish, regardless of the initial configuration, if she has to alternate between the two ways of moving and has to start with a teleportation.

Justin is being served two different types of chips, A-chips, and B-chips. If there are $3$ B-chips and $5$ A-chips, and if Justin randomly grabs $3$ chips, what is the probability that none of them are A-chips?

There are $m$ identical two-pan weighting scales. One of them is broken and it shows any outcome, at random. The other scales always show the correct outcome. Moreover, the weight of the broken scale differs from those of the other scales, which are all equal. At a move, we may choose a scale and place some of the other scales on its pans. Determine the greatest value of $m$ for which we may find the broken scale with no more than three moves. [i]Proposed by A. Gribalko and O. Manzhina[/i]

Given $2021$ distinct positive integers non divisible by $2^{1010}$, show that it's always possible to choose $3$ of them $a$, $b$ and $c$, such that $|b^2-4ac|$ is not a perfect square.

Let $M=\{1,2,3,\ldots, 10000\}.$ Prove that there are $16$ subsets of $M$ such that for every $a \in M,$ there exist $8$ of those subsets that intersection of the sets is exactly $\{a\}.$

Let $a_1,a_2,\dots, a_{17}$ be a permutation of $1,2,\dots, 17$ such that $(a_1-a_2)(a_2-a_3)\dots(a_{17}-a_1)=2^n$ . Find the maximum possible value of positive integer $n$ .

Consider the $9\times 9$ grid of lattice points $\{(x,y) | 0 \le x, y \le 8\}$. How many rectangles with nonzero area and sides parallel to the $x, y$ axes are there such that each corner is one of the lattice points and the point $(4, 4)$ is not contained within the interior of the rectangle? ($(4,4)$ is allowed to lie on the boundary of the rectangle).

[b]p1.[/b] What is the sum of the first $12$ positive integers? [b]p2.[/b] How many positive integers less than or equal to $100$ are multiples of both $2$ and $5$? [b]p3. [/b]Alex has a bag with $4$ white marbles and $4$ black marbles. She takes $2$ marbles from the bag without replacement. What is the probability that both marbles she took are black? Express your answer as a decimal or a fraction in lowest terms. [b]p4.[/b] How many $5$-digit numbers are there where each digit is either $1$ or $2$? [b]p5.[/b] An integer $a$ with $1\le a \le 10$ is randomly selected. What is the probability that $\frac{100}{a}$ is an integer? Express your answer as decimal or a fraction in lowest terms. [b]p6.[/b] Two distinct non-tangent circles are drawn so that they intersect each other. A third circle, distinct from the previous two, is drawn. Let $P$ be the number of points of intersection between any two circles. How many possible values of $P$ are there? [b]p7.[/b] Let $x, y, z$ be nonzero real numbers such that $x + y + z = xyz$. Compute $$\frac{1 + yz}{yz}+\frac{1 + xz}{xz}+\frac{1 + xy}{xy}.$$ [b]p8.[/b] How many positive integers less than $106$ are simultaneously perfect squares, cubes, and fourth powers? [b]p9.[/b] Let $C_1$ and $C_2$ be two circles centered at point $O$ of radii $1$ and $2$, respectively. Let $A$ be a point on $C_2$. We draw the two lines tangent to $C_1$ that pass through $A$, and label their other intersections with $C_2$ as $B$ and $C$. Let x be the length of minor arc $BC$, as shown. Compute $x$. [img]https://cdn.artofproblemsolving.com/attachments/7/5/915216d4b7eba0650d63b26715113e79daa176.png[/img] [b]p10.[/b] A circle of area $\pi$ is inscribed in an equilateral triangle. Find the area of the triangle. [b]p11.[/b] Julie runs a $2$ mile route every morning. She notices that if she jogs the route $2$ miles per hour faster than normal, then she will finish the route $5$ minutes faster. How fast (in miles per hour) does she normally jog? [b]p12.[/b] Let $ABCD$ be a square of side length $10$. Let $EFGH$ be a square of side length $15$ such that $E$ is the center of $ABCD$, $EF$ intersects $BC$ at $X$, and $EH$ intersects $CD$ at $Y$ (shown below). If $BX = 7$, what is the area of quadrilateral $EXCY$ ? [img]https://cdn.artofproblemsolving.com/attachments/d/b/2b2d6de789310036bc42d1e8bcf3931316c922.png[/img] [b]p13.[/b] How many solutions are there to the system of equations $$a^2 + b^2 = c^2$$ $$(a + 1)^2 + (b + 1)^2 = (c + 1)^2$$ if $a, b$, and $c$ are positive integers? [b]p14.[/b] A square of side length $ s$ is inscribed in a semicircle of radius $ r$ as shown. Compute $\frac{s}{r}$. [img]https://cdn.artofproblemsolving.com/attachments/5/f/22d7516efa240d00d6a9743a4dc204d23d190d.png[/img] [b]p15.[/b] $S$ is a collection of integers n with $1 \le n \le 50$ so that each integer in $S$ is composite and relatively prime to every other integer in $S$. What is the largest possible number of integers in $S$? [b]p16.[/b] Let $ABCD$ be a regular tetrahedron and let $W, X, Y, Z$ denote the centers of faces $ABC$, $BCD$, $CDA$, and $DAB$, respectively. What is the ratio of the volumes of tetrahedrons $WXYZ$ and $WAYZ$? Express your answer as a decimal or a fraction in lowest terms. [b]p17.[/b] Consider a random permutation $\{s_1, s_2, ... , s_8\}$ of $\{1, 1, 1, 1, -1, -1, -1, -1\}$. Let $S$ be the largest of the numbers $s_1$, $s_1 + s_2$, $s_1 + s_2 + s_3$, $...$ , $s_1 + s_2 + ... + s_8$. What is the probability that $S$ is exactly $3$? Express your answer as a decimal or a fraction in lowest terms. [b]p18.[/b] A positive integer is called [i]almost-kinda-semi-prime[/i] if it has a prime number of positive integer divisors. Given that there $are 168$ primes less than $1000$, how many almost-kinda-semi-prime numbers are there less than $1000$? [b]p19.[/b] Let $ABCD$ be a unit square and let $X, Y, Z$ be points on sides $AB$, $BC$, $CD$, respectively, such that $AX = BY = CZ$. If the area of triangle $XYZ$ is $\frac13$ , what is the maximum value of the ratio $XB/AX$? [img]https://cdn.artofproblemsolving.com/attachments/5/6/cf77e40f8e9bb03dea8e7e728b21e7fb899d3e.png[/img] [b]p20.[/b] Positive integers $a \le b \le c$ have the property that each of $a + b$, $b + c$, and $c + a$ are prime. If $a + b + c$ has exactly $4$ positive divisors, find the fourth smallest possible value of the product $c(c + b)(c + b + a)$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer. An $n \times n$ matrix (a rectangular array of numbers with $n$ rows and $n$ columns) is said to be a platinum matrix if: [list=i] [*] the $n^2$ entries are integers from $1$ to $n$; [*] each row, each column, and the main diagonal (from the upper left corner to the lower right corner) contains each integer from $1$ to $n$ exactly once; and [*] there exists a collection of $n$ entries containing each of the numbers from $1$ to $n$, such that no two entries lie on the same row or column, and none of which lie on the main diagonal of the matrix. [/list] Determine all values of $n$ for which there exists an $n \times n$ platinum matrix.

An $8 \times 8$ board is divided into unit squares. Ten of these squares have their centers marked. Prove that either there exist two marked points on the distance at most $\sqrt2$, or there is a point on the distance $1/2$ from the edge of the board.

p1. If $x + y + z = 2$, show that $\frac{1}{xy+z-1}+\frac{1}{yz+x-1}+\frac{1}{xz+y-1}=\frac{-1}{(x-1)(y-1)(z-1)}$. p2. Determine the simplest form of $\frac{3}{1!+2!+3!}+\frac{4}{2!+3!+4!}+\frac{5}{3!+4!+5!}+...+\frac{100}{98!+99!+100!}$ p3. It is known that $ABCD$ and $DEFG$ are two parallelograms. Point $E$ lies on $AB$ and point $C$ lie on $FG$. The area of $​​ABCD$ is $20$ units. $H$ is the point on $DG$ so that $EH$ is perpendicular to $DG$. If the length of $DG$ is $5$ units, determine the length of $EH$. [img]https://cdn.artofproblemsolving.com/attachments/b/e/42453bf6768129ed84fbdc81ab7235e780b0e1.png[/img] p4. Each room in the following picture will be painted so that every two rooms which is directly connected to the door is given a different color. If $10$ different colors are provided and $4$ of them can not be used close together for two rooms that are directly connected with a door, determine how many different ways to color the $4$ rooms. [img]https://cdn.artofproblemsolving.com/attachments/4/a/e80a464a282b3fe3cdadde832b2fd38b51a41a.png[/img] 5. The floor of a hall is rectangular $ABCD$ with $AB = 30$ meters and $BC = 15$ meters. A cat is in position $A$. Seeing the cat, the mouse in the midpoint of $AB$ ran and tried to escape from cat. The mouse runs from its place to point $C$ at a speed of $3$ meters/second. The trajectory is a straight line. Watching the mice run away, at the same time from point $A$ the cat is chasing with a speed of $5$ meters/second. If the cat's path is also a straight line and the mouse caught before in $C$, determine an equation that can be used for determine the position and time the mouse was caught by the cat.

Is it true that for integer $n\ge 2$, and given any non-negative reals $\ell_{ij}$, $1\le i<j\le n$, we can find a sequence $0\le a_1,a_2,\ldots,a_n$ such that for all $1\le i<j\le n$ to have $|a_i-a_j|\ge \ell_{ij}$, yet still $\sum_{i=1}^n a_i\le \sum_{1\le i<j\le n}\ell_{ij}$?

Ezzie is walking around the perimeter of a regular hexagon. Each vertex of the hexagon has an instruction telling him to move clockwise or counterclockwise around the hexagon. However, when he leaves a vertex the instruction switches from clockwise to counterclockwise on that vertex, or vice versa. We say that a configuration $C$ of Ezzie’s position and the instructions on the vertices is [I]irrepeatable[/I] if, when starting from configuration $C,$ configuration $C$ only appears finitely many more times. Find the number of irrepeatable configurations.

SQUARING OFF: Master Chief and Samus Aran take turns firing rockets at one another from across the Cartesian plane. Master Chief’s movement is restricted to lattice points within the $10\times 10$ square with vertices $(0,0)$, $(0,10)$, $(10,0)$, and $(10,10)$, while Samus Aran’s movement is restricted to lattice points inside the $10\times 10$ square with vertices $(0,0)$, $(-10,0)$, $(0,-10)$, and $(-10,-10)$. Neither player can be located on or beyond the border of his or her square. Both players randomly choose a lattice point at which they begin the game, and do not move the rest of the game (until either they are killed or kill the other player). Each player’s turn consists of firing a rocket, targeted at a specific undestroyed lattice point inside the border of the opponent’s movement square, which hits immediately. When a rocket hits its intended lattice point, it explodes, destroying the surrounding $3\times 3$ square ($8$ additional adjacent lattice points). The game ends when one player is hit by a rocket (when the player is located within the $3\times 3$ grid hit by a rocket). If the highest possible probability that Samus Aran wins the game in three turns or less, assuming Master Chief goes first, is expressed as $a/b$, where $a$ and $b$ are relatively prime integers, find $a+b$.

Six tennis players gather to play in a tournament where each pair of persons play one game, with one person declared the winner and the other person the loser. A triplet of three players $\{\mathit{A}, \mathit{B}, \mathit{C}\}$ is said to be [i]cyclic[/i] if $\mathit{A}$ wins against $\mathit{B}$, $\mathit{B}$ wins against $\mathit{C}$ and $\mathit{C}$ wins against $\mathit{A}$. [list] [*] (a) After the tournament, the six people are to be separated in two rooms such that none of the two rooms contains a cyclic triplet. Prove that this is always possible. [*] (b) Suppose there are instead seven people in the tournament. Is it always possible that the seven people can be separated in two rooms such that none of the two rooms contains a cyclic triplet?[/list]

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

Let $n$ be the answer to this problem. An urn contains white and black balls. There are $n$ white balls and at least two balls of each color in the urn. Two balls are randomly drawn from the urn without replacement. Find the probability, in percent, that the rst ball drawn is white and the second is black.

Let $ S$ be a set of $ 6n$ points in a line. Choose randomly $ 4n$ of these points and paint them blue; the other $ 2n$ points are painted green. Prove that there exists a line segment that contains exactly $ 3n$ points from $ S$, $ 2n$ of them blue and $ n$ of them green.

Two people, $A$ and $B$, play the following game with a deck of 32 cards. With $A$ starting, and thereafter the players alternating, each player takes either 1 card or a prime number of cards. Eventually all of the cards are chosen, and the person who has none to pick up is the loser. Who will win the game if they both follow optimal strategy?

Suppose there are $n$ points on the plane, no three of which are collinear. Draw $n-1$ non-intersecting segments (except possibly at endpoints) between pairs of points, such that it is possible to travel between any two points by travelling along the segments. Such a configuration of points and segments is called a [i]network[/i]. Given a network, we may assign labels from $1$ to $n-1$ to each segment such that each segment gets a different label. Define a [i]spin[/i] as the following operation: $\bullet$ Choose a point $v$ and rotate the labels of its adjacent segments clockwise. Formally, let $e_1,e_2,\cdots,e_k$ be the segments which contain $v$ as an endpoint, sorted in clockwise order (it does not matter which segment we choose as $e_1$). Then, the label of $e_{i+1}$ is replaced with the label of $e_{i}$ simultaneously for all $1 \le i \le k$. (where $e_{k+1}=e_{1}$) A network is [i]nontrivial[/i] if there exists at least $2$ points with at least $2$ adjacent segments each. A network is [i]versatile[/i] if any labeling of its segments can be obtained from any initial labeling using a finite amount of spins. Find all integers $n \ge 5$ such that any nontrivial network with $n$ points is versatile. [i]Proposed by Yeoh Zi Song[/i]

Let $n$ be a positive integer, set $S_n = \{ (a_1,a_2,\cdots,a_{2^n}) \mid a_i=0 \ \text{or} \ 1, 1 \leq i \leq 2^n\}$. For any two elements $a=(a_1,a_2,\cdots,a_{2^n})$ and $b=(b_1,b_2,\cdots,b_{2^n})$ of $S_n$, define \[ d(a,b)= \sum_{i=1}^{2^n} |a_i - b_i| \] We call $A \subseteq S_n$ a $\textsl{Good Subset}$ if $d(a,b) \geq 2^{n-1}$ holds for any two distinct elements $a$ and $b$ of $A$. How many elements can the $\textsl{Good Subset}$ of $S_n$ at most have?

Ana and Beto are playing a game. Ana writes a whole number on the board. Beto then has the right to erase the number and add $2$ to it, or erase the number and subtract $3$, as many times as he wants. Beto wins if he can get $2021$ after a finite number of stages; otherwise, Ana wins. Which player has a winning strategy?