Sixty-four dice with the numbers ”one” to ”six” are placed on one table and formed into a square with eight horizontal and eight vertical rows of cubes pushed together. By rotating the dice, while maintaining their place, we want to finally have all sixty-four dice the "one" points upwards. Each dice however, may not be turned individually, but only every eight dice in a horizontal or vertical row together by $90^o$ to the longitudinal axis of this row may turn. Prove that it is always possible to solve the dice by repeatedly applying the permitted type of rotation to the required end position.

It is possible to paint with the colors red and blue the squares of a grid board $1999\times 1999$, so that in each of the $1999$ rows, in each of the $1999$ columns and each of the the $2$ diagonals are exactly $1000$ squares painted red?

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

Two points are selected in a convex pentagon. Prove that you can choose a quadrilateral with vertices at the vertices of a pentagon so that both selected points fall into it.

Let each sequence of capital Bulgarian letters be a word (Note that the Bulgarian alphabet consists of 30 letters). We say that a word is [i]calm[/i], if there is no sequence of the letter $P$ in it (two letters $P$ next to each other). Find a clear expression for $f(n)$ (closed formula), which represents the number of calm words with length $n$. Example: [i]РНТ[/i] and [i]ТТРВ[/i] are calm, but [i]ЖГРР[/i] and [i]ЖРРРП[/i] aren’t.

Players $A$ and $B$ play the following game. Each of them throws a dice, and if the outcomes are $x$ and $y$ respectively, a list of all two digit numbers $10a + b$ with $a,b\in \{1,..,6\}$ and $10a + b \le 10x + y$ is created. Then the players alternately reduce the list by replacing a pair of numbers in the list by their absolute difference, until only one number remains. If the remaining number is of the same parity as the outcome of $A$’s throw, then $A$ is proclaimed the winner. What is the probability that $A$ wins the game?

Determine all positive integers $ n$ for which there is a coloring of all points in space so that each of the following conditions is satisfied: (i) Each point is painted in exactly one color. (ii) Exactly $ n$ colors are used. (iii) Each line is painted in at most two different colors.

Points $A_1, A_2, ..., A_{10}$ are marked on a circle clockwise. It is known that these points can be divided into pairs of points symmetric with respect to the centre of the circle. Initially at each marked point there was a grasshopper. Every minute one of the grasshoppers jumps over its neighbour along the circle so that the resulting distance between them doesn't change. It is not allowed to jump over any other grasshopper and to land at a point already occupied. It occurred that at some moment nine grasshoppers were found at points $A_1, A_2, ... , A_9$ and the tenth grasshopper was on arc $A_9A_{10}A_1$. Is it necessarily true that this grasshopper was exactly at point $A_{10}$?

A tree $T$ is given. Starting with the complete graph on $n$ vertices, subgraphs isomorphic to $T$ are erased at random until no such subgraph remains. For what trees does there exist a positive constant $c$ such that the expected number of edges remaining is at least $cn^2$ for all positive integers $n$? [i]David Yang.[/i]

$n$ students want to equally partition $m$ identical cakes between themselves. What’s the minimal number of pieces of cake one has to cut, so that the upper condition is satisfied? Each cut increases the number of pieces by 1.

[b](a)[/b]Prove that every pentagon with integral coordinates has at least two vertices , whose respective coordinates have the same parity. [b](b)[/b]What is the smallest area possible of pentagons with integral coordinates. Albanian National Mathematical Olympiad 2010---12 GRADE Question 3.

Let $n\ge 3$ be an integer. Annalena has infinitely many cowbells in each of $n$ different colours. Given an integer $m \ge n + 1$ and a group of $m$ cows standing in a circle, she is tasked with tying one cowbell around the neck of every cow so that every group of $n + 1$ consecutive cows have cowbells of all the possible $n$ colours. Prove that there are only finitely many values of $m$ for which this is not possible and determine the largest such $m$ in terms of $n$.

In a country, towns are connected by roads. Each town is directly connected to exactly three other towns. Show that there exists a town from which you can make a round-trip, without using the same road more than once, and for which the number of roads used is not divisible by $3$. (Not all towns need to be visited.)

Let $A$ be a set of $n$ non-negative integers. We say it has property $\mathcal P$ if the set $\{x + y \mid x, y \in A\}$ has $\binom{n}{2}$ elements. We call the largest element of $A$ minus the smallest element, the diameter of $A$. Let $f(n)$ be the smallest diameter of any set $A$ with property $\mathcal P$. Show that $n^2 \leq 4 f(n) < 4 n^3$. [hide="Comment"](If you have some amount of time, try a best estimative for $f(n)$, such that $f(p)<2p^2$ for prime $p$).[/hide]

On a board 12 × 12 are placed some knights in such a way that in each 2 × 2 square there is at least one knight. Find the maximum number of squares that are not attacked by knights. (A knight does not attack the square in which it is located.)

The edges of a cube are labeled from 1 to 12 in an arbitrary manner. Show that it is not possible to get the sum of the edges at each vertex the same. Show that we can get eight vertices with the same sum if one of the labels is changed to 13.

Show that we cannot form more than $4096$ binary sequences of length $24$ so that any two differ in at least $8$ positions.

Given four weights in geometric progression and an equal arm balance, show how to find the heaviest weight using the balance only twice.

Every evening uncle Chernomor (see Pushkin's tales) appoints either $9$ or $10$ of his 33 "knights" in the "night guard". When it can happen, for the first time, that every knight has been on duty the same number of times?

A $20 \times 20$ rectangular grid has been given. It is known that one of the grid's unit squares contains a hidden treasure. To find the treasure, we have been given an opportunity to order several scientific studies at the same time, results of which will be known only after some time. For each study we must choose one $1 \times 4$ rectangle, and the study will tell whether the rectangle contains the treasure. The $1 \times 4$ rectangle can be either horizontal or vertical, and it can extend over a side of the $20 \times 20$ grid, coming back in at the opposite side (you can think of the $20 \times 20$ grid as a torus - the opposite sides are connected). What is the minimal amount of studies that have to ordered for us to precisely determine the unit square containing the treasure?

Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)

Let's call several numbers written in a row a 'combination of numbers'. In the country of Robotland, some combinations of numbers have been declared prohibited. It is known that there are a finite number of forbidden combinations and there is an infinite decimal fraction that does not contain forbidden combinations. Prove that there is an infinite periodic decimal fraction that does not contain prohibited combinations.

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

Someone wrote six letters to six people and addressed six envelopes to them. How many ways can the letters be put into the envelopes so that none of the letters end up in the correct envelope?

How many four-digit positive integers $\overline{a_1a_2a_3a_4}$ have only nonzero digits and have the property that $|a_i-a_j| \neq 1$ for all $1 \leq i<j \leq 4?$ [i]Proposed by Kyle Lee[/i]