Prove that the entire space can be partitioned into “crosses” made of seven unit cubes as shown in the picture. [img]https://cdn.artofproblemsolving.com/attachments/2/b/77c4a4309170e8303af321daceccc4010da334.png[/img]

In conference there $n>2$ mathematicians. Every two mathematicians communicate in one of the $n$ offical languages of the conference. For any three different offical languages the exists three mathematicians who communicate with each other in these three languages. Find all $n$ such that this is possible.

A given convex polyhedron has no vertex which belongs to exactly 3 edges. Prove that the number of faces of the polyhedron that are triangles, is at least 8.

a) Is it possible to colour the positive rational numbers with blue and red in a way that there are numbers of both colours and the sum of any two numbers of the same colour is the same colour as them? b) Is it possible to colour the positive rational numbers with blue and red in a way that there are numbers of both colours and the product of any two numbers of the same colour is the same colour as them? Note: When forming a sum or a product, it is allowed to pick the same number twice.

The integers from $1$ to $100$ are written on a “mathlotto” ticket. When you buy a “mathlotto” ticket, you choose $10 $ of these $100$ numbers. Then 10 of the integers from $1$ to $100$ are drawn, and a winning ticket is one which does not contain any of them. Prove that (a) if you buy $13$ tickets, you can choose your numbers so that regardless of which numbers are drawn, you are guaranteed to have at least one winning ticket; (b) if you buy only $12$ tickets, it is possible for you not to have any winning tickets, regardless of how you choose your numbers. (S Tokarev)

Let N be a positive integer greater than 2. We number the vertices of a regular 2n-gon clockwise with the numbers 1, 2, . . . ,N,−N,−N + 1, . . . ,−2,−1. Then we proceed to mark the vertices in the following way. In the first step we mark the vertex 1. If ni is the vertex marked in the i-th step, in the i+1-th step we mark the vertex that is |ni| vertices away from vertex ni, counting clockwise if ni is positive and counter-clockwise if ni is negative. This procedure is repeated till we reach a vertex that has already been marked. Let $f(N)$ be the number of non-marked vertices. (a) If $f(N) = 0$, prove that 2N + 1 is a prime number. (b) Compute $f(1997)$.

A white bug sits in one corner square of a $1000$ × $n$ chessboard, where $n$ is an odd positive integer and $n > 2020$. In the two nearest corner squares there are two black chess bishops. On each move, the bug either steps into a square adjacent by side or moves as a chess knight. The bug wishes to reach the opposite corner square by never visiting a square occupied or attacked by a bishop, and visiting every other square exactly once. Show that the number of ways for the bug to attain its goal does not depend on $n$.

Assume that the connected graph $G$ has $n$ vertices all with degree at least three. Prove that there exists a spanning tree of $G$ with more than $\frac{2}{9}n$ leaves.

Determine the number of distinct sequences of letters of length 1997 which use each of the letters $A$, $B$, $C$ (and no others) an odd number of times.

Eighteen people are standing in a (socially-distanced) line to enter a grocery store. Five people are wearing a black mask, $6$ are wearing a gray mask, and $7$ are wearing a white mask. Suppose that these $18$ people got on line in a random order. The expected number of pairs of adjacent people wearing different-colored masks can be given by $\tfrac{a}{b}$, where $\gcd(a, b) = 1$. Compute $a+b$.

Let $ N $ be a positive integer. A set $ S \subset \{ 1, 2, \cdots, N \} $ is called [i]allowed[/i] if it does not contain three distinct elements $ a, b, c $ such that $ a $ divides $ b $ and $ b $ divides $c$. Determine the largest possible number of elements in an allowed set $ S $.

On the plane are chosen $n \ge 3$ points, not all on the same line. Drawing all lines passing through two of these points one obtains k different lines. Prove that $k \ge n$.

Yukihira is counting the minimum number of lines $m$, that can be drawn on the plane so that they intersect in exactly $200$ distinct points.What is $m$?

A [i]windmill[/i] is a closed line segment of unit length with a distinguished endpoint, the [i]pivot[/i]. Let $S$ be a finite set of $n$ points such that the distance between any two points of $S$ is greater than $c$. A configuration of $n$ windmills is [i]admissible[/i] if no two windmills intersect and each point of $S$ is used exactly once as a pivot. An admissible configuration of windmills is initially given to Geoff in the plane. In one operation Geoff can rotate any windmill around its pivot, either clockwise or counterclockwise and by any amount, as long as no two windmills intersect during the process. Show that Geoff can reach any other admissible configuration in finitely many operations, where (i) $c = \sqrt 3$, (ii) $c = \sqrt 2$. [i]Proposed by Michael Ren[/i]

We are given $30$ non-zero vectors in $3$ dimensional space. Prove that among these there are two such that the angle between them is less than $45^o$.

Given is $2022\times 2022$ cells table. We can select $4$ cells, such that they make the figure $L$ (rotations, symmetric still count) (left one) and put a ball in each of them, or select $4$ cell which makes up the right figure (rotations, symmetric still count) and get one ball from each of them. For which $k$ is it possible in a given moment to be exactly $k$ points in each of the cells

1. Every square of a $8 \times 8$ board is filled with a positive integer, such that the following condition holds: if a chess knight can move from some square to another then the ratio of numbers from these two squares is a prime number. Is it possible that some square is filled with 5 , and another one with 6 ? Egor Bakaev

Let $S$ be a set of $9$ distinct integers all of whose prime factors are at most $3.$ Prove that $S$ contains $3$ distinct integers such that their product is a perfect cube.

$1\times 2$ dominoes are placed on an $8 \times 8$ chessboard without overlapping. They may partially stick out from the chessboard but the center of each domino must be strictly inside the chessboard (not on its border). Place on the chessboard in such a way: a) at least $40$ dominoes, (3 points) b) at least $41$ dominoes, (3 points) c) more than $41$ dominoes. (6 points) [i](Mikhail Evdokimov)[/i]

In the class, there are $ 15$ boys and $ 15$ girls. On March $ 8$, some boys made phone calls to some girls to congratulate them on the holiday ( each boy made no more than one call to each girl). It appears that there is a unique way to split the class in $ 15$ pairs (each consisting of a boy and a girl) such that in every pair the boy has phoned the girl. Find the maximal possible number of calls.

Given an equilateral triangle, all points on its sides are colored in one of two given colors. Prove that the is a right-angled triangle such that its three vertices are in the same color and on the sides of the equilateral triangle. [i]Alhaji Akbar, Jakarta[/i]

Prove that there exist $78$ lines in the plane such that they have exactly $1992$ points of intersection.

Let $M$ be a subset of the set of $2021$ integers $\{1, 2, 3, ..., 2021\}$ such that for any three elements (not necessarily distinct) $a, b, c$ of $M$ we have $|a + b - c | > 10$. Determine the largest possible number of elements of $M$.

William is thinking of an integer between 1 and 50, inclusive. Victor can choose a positive integer $m$ and ask William: "does $m$ divide your number?", to which William must answer truthfully. Victor continues asking these questions until he determines William's number. What is the minimum number of questions that Victor needs to guarantee this?

Let $A=\{1,2,\ldots,2012\}, \: B=\{1,2,\ldots,19\}$ and $S$ be the set of all subsets of $A.$ Find the number of functions $f : S\to B$ satisfying $f(A_1\cap A_2)=\min\{f(A_1),f(A_2)\}$ for all $A_1, A_2 \in S.$