A polygon has each side integral and each pair of adjacent sides perpendicular (it is not necessarily convex). Show that if it can be covered by non-overlapping $2 x 1$ dominos, then at least one of its sides has even length.

In an attempt to beat the Belgian handshake record come on $20/09/2009$ exactly $2009$ Belgians together in a large sports hall. Among them are Nathalie and thomas. During this event, everyone shakes hands with everyone exactly once other attendees. Afterwards, Nathalie says: “I have exactly $5$ times as many Flemish people shaken hands as people from Brussels.” Thomas replies with “I have exactly $3$ times as much Walloons and Brussels people shook hands”. From which region does Nathalie come and from which region comes Thomas?

$$Problem 3:$$ Is it possible to mark 10 red, 10 blue and 10 green points on a plane such that: For each red point A, the point (among the marked ones) closest to A is blue; for each blue point B, the point closest to B is green; and for each green point C, the point closest to C is red?

Dagan has a wooden cube. He paints each of the six faces a different color. He then cuts up the cube to get eight identically-sized smaller cubes, each of which now has three painted faces and three unpainted faces. He then puts the smaller cubes back together into one larger cube such that no unpainted face is visible. Compute the number of different cubes that Dagan can make this way. Two cubes are considered the same if one can be rotated to obtain the other. You may express your answer either as an integer or as a product of prime numbers.

Let $n\ge2$ be an integer and let $x_1,x_2,\ldots,x_n$ be real numbers. Consider $N=\binom n2$ sums $x_i+x_j$, $1\le i<j\le n$, and denote them by $y_1,y_2,\ldots,y_N$ (in an arbitrary order). For which $n$ are the numbers $x_1,x_2,\ldots,x_n$ uniquely determined by the numbers $y_1,y_2,\ldots,y_N$?

In Sikinia we only pay with coins that have a value of either $11$ or $12$ Kulotnik. In a burglary in one of Sikinia's banks, $11$ bandits cracked the safe and could get away with $5940$ Kulotnik. They tried to split up the money equally - so that everyone gets the same amount - but it just doesn't worked. After a while their leader claimed that it actually isn't possible. Prove that they didn't get any coin with the value $12$ Kulotnik.

Let $A$ and $B$ be two cubes. Numbers $1,2,...,14$, are assigned in any order, to the faces and vertices of cube $A$. Then each edge of cube $A$ is assigned the average of the numbers assigned to the two faces that contain it. Finally assigned to each face of the cube $B$ the sum of the numbers associated with the vertices, the face and the edges on the corresponding face of cube $A$. If $S$ is the sum of the numbers assigned to the faces of $B$, find the largest and smallest value that $S$ can take.

How many integer solutions $ (x_0$, $ x_1$, $ x_2$, $ x_3$, $ x_4$, $ x_5$, $ x_6)$ does the equation \[ 2x_0^2\plus{}x_1^2\plus{}x_2^2\plus{}x_3^2\plus{}x_4^2\plus{}x_5^2\plus{}x_6^2\equal{}9\] have?

We colour all the sides and diagonals of a regular polygon $P$ with $43$ vertices either red or blue in such a way that every vertex is an endpoint of $20$ red segments and $22$ blue segments. A triangle formed by vertices of $P$ is called monochromatic if all of its sides have the same colour. Suppose that there are $2022$ blue monochromatic triangles. How many red monochromatic triangles are there?

Given an infinite sequence of numbers $a_1, a_2,...$, in which there are no two equal members. Segment $a_i, a_{i+1}, ..., a_{i+m-1}$ of this sequence is called a monotone segment of length $m$, if $a_i < a_{i+1} <...<a_{i+m-1}$ or $a_i > a_{i+1} >... > a_{i+m-1}$. It turned out that for each natural $k$ the term $a_k$ is contained in some monotonic segment of length $k + 1$. Prove that there exists a natural $N$ such that the sequence $a_N , a_{N+1} ,...$ monotonic.

[b]a)[/b] Prove that if $G$ is $2$-connected, then it has a cycle with the length at least $\min\{n(G),2\delta(G)\}$. (10 points) [b]b)[/b] Prove that every $2k$-regular graph with $4k+1$ vertices has a hamiltonian cycle. (10 points)

Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$. Determine the smallest number of pieces Paul needs to make in order to accomplish this.

[i]25 problems for 30 minutes[/i] [b]p1.[/b] You and nine friends spend $4000$ dollars on tickets to attend the new Harry Styles concert. Unfortunately, six friends cancel last minute due to the u. You and your remaining friends still attend the concert and split the original cost of $4000$ dollars equally. What percent of the total cost does each remaining individual have to pay? [b]p2.[/b] Find the number distinct $4$ digit numbers that can be formed by arranging the digits of $2021$. [b]p3.[/b] On a plane, Darnay draws a triangle and a rectangle such that each side of the triangle intersects each side of the rectangle at no more than one point. What is the largest possible number of points of intersection of the two shapes? [b]p4.[/b] Joy is thinking of a two-digit number. Her hint is that her number is the sum of two $2$-digit perfect squares $x_1$ and $x_2$ such that exactly one of $x_i - 1$ and $x_i + 1$ is prime for each $i = 1, 2$. What is Joy's number? [b]p5.[/b] At the North Pole, ice tends to grow in parallelogram structures of area $60$. On the other hand, at the South Pole, ice grows in right triangular structures, in which each triangular and parallelogram structure have the same area. If every ice triangle $ABC$ has legs $\overline{AB}$ and $\overline{AC}$ that are integer lengths, how many distinct possible lengths are there for the hypotenuse $\overline{BC}$? [b]p6.[/b] Carlsen has some squares and equilateral triangles, all of side length $1$. When he adds up the interior angles of all shapes, he gets $1800^o$. When he adds up the perimeters of all shapes, he gets $24$. How many squares does he have? [b]p7.[/b] Vijay wants to hide his gold bars by melting and mixing them into a water bottle. He adds $100$ grams of liquid gold to $100$ grams of water. His liquefied gold bars have a density of $20$ g/ml and water has a density of $1$ g/ml. Given that the density of the mixture in g/mL can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute the sum $m + n$. (Note: density is mass divided by volume, gram (g) is unit of mass and ml is unit of volume. Further, assume the volume of the mixture is the sum of the volumes of the components.) [b]p8.[/b] Julius Caesar has epilepsy. Specifically, if he sees $3$ or more flashes of light within a $0.1$ second time frame, he will have a seizure. His enemy Brutus has imprisoned him in a room with $4$ screens, which flash exactly every $4$, $5$, $6$, and $7$ seconds, respectively. The screens all flash at once, and $105$ seconds later, Caesar opens his eyes. How many seconds after he opened his eyes will Caesar first get a seizure? [b]p9.[/b] Angela has a large collection of glass statues. One day, she was bored and decided to use some of her statues to create an entirely new one. She melted a sphere with radius $12$ and a cone with height of 18 and base radius of $2$. If Angela wishes to create a new cone with a base radius $2$, what would the the height of the newly created cone be? [b]p10.[/b] Find the smallest positive integer $N$ satisfying these properties: (a) No perfect square besides $1$ divides $N$. (b) $N$ has exactly $16$ positive integer factors. [b]p11.[/b] The probability of a basketball player making a free throw is $\frac15$. The probability that she gets exactly $2$ out of $4$ free throws in her next game can be expressed as $\frac{m}{n}$ for relatively prime positive integers m and n. Find $m + n$. [b]p12.[/b] A new donut shop has $1000$ boxes of donuts and $1000$ customers arriving. The boxes are numbered $1$ to $1000$. Initially, all boxes are lined up by increasing numbering and closed. On the first day of opening, the first customer enters the shop and opens all the boxes for taste testing. On the second day of opening, the second customer enters and closes every box with an even number. The third customer then "reverses" (if closed, they open it and if open, they close it) every box numbered with a multiple of three, and so on, until all $1000$ customers get kicked out for having entered the shop and reversing their set of boxes. What is the number on the sixth box that is left open? [b]p13.[/b] For an assignment in his math class, Michael must stare at an analog clock for a period of $7$ hours. He must record the times at which the minute hand and hour hand form an angle of exactly $90^o$, and he will receive $1$ point for every time he records correctly. What is the maximum number of points Michael can earn on his assignment? [b]p14.[/b] The graphs of $y = x^3 +5x^2 +4x-3$ and $y = -\frac15 x+1$ intersect at three points in the Cartesian plane. Find the sum of the $y$-coordinates of these three points. [b]p15.[/b] In the quarterfinals of a single elimination countdown competition, the $8$ competitors are all of equal skill. When any $2$ of them compete, there is exactly a $50\%$ chance of either one winning. If the initial bracket is randomized, the probability that two of the competitors, Daniel and Anish, face off in one of the rounds can be expressed as $\frac{p}{q}$ for relatively prime positive integers $p$, $q$. Find $p + q$. [b]p16.[/b] How many positive integers less than or equal to $1000$ are not divisible by any of the numbers $2$, $3$, $5$ and $11$? [b]p17.[/b] A strictly increasing geometric sequence of positive integers $a_1, a_2, a_3,...$ satisfies the following properties: (a) Each term leaves a common remainder when divided by $7$ (b) The first term is an integer from $1$ to $6$ (c) The common ratio is an perfect square Let $N$ be the smallest possible value of $\frac{a_{2021}}{a_1}$. Find the remainder when $N$ is divided by $100$. [b]p18.[/b] Suppose $p(x) = x^3 - 11x^2 + 36x - 36$ has roots $r, s,t$. Find %\frac{r^2 + s^2}{t}+\frac{s^2 + t^2}{r}+\frac{t^2 + r^2}{s}%. [b]p19.[/b] Let $a, b \le 2021$ be positive integers. Given that $ab^2$ and $a^2b$ are both perfect squares, let $G = gcd(a, b)$. Find the sum of all possible values of $G$. [b]p20.[/b] Jessica rolls six fair standard six-sided dice at the same time. Given that she rolled at least four $2$'s and exactly one $3$, the probability that all six dice display prime numbers can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$, $n$. What is $m + n$? [b]p21.[/b] Let $a, b, c$ be numbers such $a + b + c$ is real and the following equations hold: $$a^3 + b^3 + c^3 = 25$$ $$\frac{1}{ab}+\frac{1}{bc}+\frac{1}{ac}= 1$$ $$\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{25}{9}$$ The value of $a + b + c$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$, $n$. Find $m + n$. [b]p22.[/b] Let $\omega$ be a circle and $P$ be a point outside $\omega$. Let line $\ell$ pass through $P$ and intersect $\omega$ at points $A,B$ and with $PA < PB$ and let $m$ be another line passing through $P$ intersecting $\omega$ at points $C,D$ with $PC < PD$. Let X be the intersection of $AD$ and $BC$. Given that $\frac{PC}{CD}=\frac23$, $\frac{PC}{PA}=\frac45$, and $\frac{[ABC]}{[ACD]}=\frac79$,the value of $\frac{[BXD]}{[BXA]}$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$: Find $m + n$. [b]p23.[/b] Define the operation $a \circ b =\frac{a^2 + 2ab + a - 12}{b}$. Given that $1 \circ (2 \circ (3 \circ (... 2019 \circ (2020 \circ 2021)))...)$ can be expressed as $-\frac{a}{b}$ for some relatively prime positive integers $a,b$, compute $a + b$. [b]p24.[/b] Find the largest integer $n \le 2021$ for which $5^{n-3} | (n!)^4$ [b]p25.[/b] On the Cartesian plane, a line $\ell$ intersects a parabola with a vertical axis of symmetry at $(0, 5)$ and $(4, 4)$. The focus $F$ of the parabola lies below $\ell$, and the distance from $F$ to $\ell$ is $\frac{16}{\sqrt{17}}$. Let the vertex of the parabola be $(x, y)$. The sum of all possible values of $y$ can be expressed as $\frac{p}{q}$ for relatively prime positive integers $p, q$. Find $p + q$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The city of Neverreturn has $N$ bus stops numbered $1, 2, \cdots , N.$ Each bus route is one-way and has only two stops, the beginning and the end. The route network is such that departing from any stop one cannot return to it using city buses. When the mayor notices a route going from a stop with a greater number to a stop with a lesser number, he orders to exchange the number plates of its beginning and its end. Can the plate changing go on infinitely? [i](K. Ivanov )[/i]

A number of $n$ lamps ($n\ge 3$) are put at $n$ vertices of a regular $n$-gon. Initially, all the lamps are off. In each step. Lisa will choose three lamps that are located at three vertices of an isosceles triangle and change their states (from off to on and vice versa). Her aim is to turn on all the lamps. At least how many steps are required to do so?

In a test, $3n$ students participate, who are located in three rows of $n$ students in each. The students leave the test room one by one. If $N_1(t), N_2(t), N_3(t)$ denote the numbers of students in the first, second, and third row respectively at time $t$, find the probability that for each t during the test, \[|N_i(t) - N_j(t)| < 2, i \neq j, i, j = 1, 2, \dots .\]

$d$ and $n$ are positive integers such that $d \mid n$. The n-number sets $(x_1, x_2, \cdots x_n)$ satisfy the following condition: (1) $0 \leq x_1 \leq x_2 \leq \cdots \leq x_n \leq n$ (2) $d \mid (x_1+x_2+ \cdots x_n)$ Prove that in all the n-number sets that meet the conditions, there are exactly half satisfy $x_n=n$.

There are $n>1$ cities in Jansonland, with two-way roads joining certain pairs of cities. Janson will send a few robots one-by-one to build more roads. The robots operate as such: 1. Janson first selects an integer $k$ and a list of cities $a_0, a_1, \dots, a_k$ (cities can repeat). 2. The robot begins at $a_0$ and goes to $a_1$, then $a_2$, and so on until $a_k$. 3. When the robot goes from $a_i$ to $a_{i+1}$, if there is no road then the robot builds a road, but if there is a road then the robot destroys the road. In terms of $n$, determine the smallest constant $k$ such that Janson can always achieve a configuration such that every pair of cities has a road connecting them using no more than $k$ robots. [i](Proposed by Ho Janson)[/i]

During a fight, each of the $2001$ roosters has torn out exactly one feather of another rooster, and each rooster has lost a feather. It turned out that among any three roosters there is one who hasn’t torn out a feather from any of the other two roosters. Find the smallest $k$ with the following property: It is always possible to kill $k$ roosters and place the rest into two henhouses in such a way that no two roosters, one of which has torn out a feather from the other one, stay in the same henhouse.

We are given an infinite row of cells extending infinitely in both directions. Some cells contain one or more stones. The total number of stones is finite. At each move, the player performs one of the following three operations: [b]1. [/b]Take three stones from some cell, and add one stone to the cells located one cell to the left and one cell to the right, each skipping one cell in between. [b]2. [/b]Take two stones from some cell, and add one stone to the cell one cell to the left, skipping one cell and one stone to the adjacent cell to the right. [b]3.[/b] Take one stone from each of two adjacent cells, and add one stone to the cell to the right of these two cells. The process ends when no moves are possible. Prove that the process always terminates and the final distribution of stones does not depend on the choices of moves made by the player. [img]https://i.imgur.com/IjcIDOa.png[/img] [i]Proposed by Luka Tsulaia, Georgia[/i]

$2017$ chess players participated in the chess tournament, each of them played exactly one chess game with each other. Let's call a trio of chess players $A, B, C$ a [i]principled [/i]one, if $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. What is the largest possible number of threes of principled chess players?

Given a set $A$ of positive integers, the set $A'$ is composed from the elements of $A$ and all positive integers that can be obtained in the following way: Write down some elements of $A$ one after another without repeating, write a sign $+ $ or $-$ before each of them, and evaluate the obtained expression. The result is included in $A'$. For example, if $A = \{2,8,13,20\}$, numbers $8$ and $14 = 20-2+8$ are elements of $A'$. Set $A''$ is constructed from $A'$ in the same manner. Find the smallest possible number of elements of $A$, if $A''$ contains all the integers from $1$ to $40$.

Let $G$ be a simple graph on $n$ vertices with at least one edge, and let us consider those $S:V(G)\to\mathbb R^{\ge 0}$ weighings of the vertices of the graph for which $\sum_{v\in V(G)} S(v)=1$. Furthermore define \[f(G)=\max_S\min_{(v,w)\in E(G)}S(v)S(w),\] where $S$ runs through all possible weighings. Prove that $f(G)=\frac1{n^2}$ if and only if the vertices of $G$ can be covered with a disjoint union of edges and odd cycles. ($V(G)$ denotes the vertices of graph $G$, $E(G)$ denotes the edges of graph $G$.)

A valid lottery ticket is formed by choosing $5$ distinct numbers from $1, 2,3,..., 90$. What is the probability that the winning ticket contains at least two consecutive numbers?

A rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary. [i]Author: Kei Irie, Japan[/i]