Three faces of a regular tetrahedron are painted in white and the remaining one in black. Initially, the tetrahedron is positioned on a plane with the black face down. It is then tilted several times over its edges. After a while it returns to its original position. Can it now have a white face down?

There are $9$ visually indistinguishable coins, and one of them is fake and thus lighter. We are given $3$ indistinguishable balance scales to find the fake coin; however, one of the scales is defective and shows a random result each time. Show that the fake coin can still be found with $4$ weighings.

Consider all segments dividing the area of a triangle $ABC$ in two equal parts. Find the length of the shortest segment among them, if the side lengths $a,$ $b,$ $c$ of triangle $ABC$ are given. How many of these shortest segments exist ?

[b]p1.[/b] Find all triples of positive integers such that the sum of their reciprocals is equal to one. [b]p2.[/b] Prove that $a(a + 1)(a + 2)(a + 3)$ is divisible by $24$. [b]p3.[/b] There are $20$ very small red chips and some blue ones. Find out whether it is possible to put them on a large circle such that (a) for each chip positioned on the circle the antipodal position is occupied by a chip of different color; (b) there are no two neighboring blue chips. [b]p4.[/b] A $12$ liter container is filled with gasoline. How to split it in two equal parts using two empty $5$ and $8$ liter containers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Find any integer solution of the puzzle: $WE+ST+RO+NG=128$ (different letters mean different digits between $1$ and $9$). [b]p2.[/b] A $5\times 6$ rectangle is drawn on the piece of graph paper (see the figure below). The side of each square on the graph paper is $1$ cm long. Cut the rectangle along the sides of the graph squares in two parts whose areas are equal but perimeters are different by $2$ cm. $\begin{tabular}{|l|l|l|l|l|l|} \hline & & & & & \\ \hline & & & & & \\ \hline & & & & & \\ \hline & & & & & \\ \hline \end{tabular}$ [b]p3.[/b] Three runners started simultaneously on a $1$ km long track. Each of them runs the whole distance at a constant speed. Runner $A$ is the fastest. When he runs $400$ meters then the total distance run by runners $B$ and $C$ together is $680$ meters. What is the total combined distance remaining for runners $B$ and $C$ when runner $A$ has $100$ meters left? [b]p4.[/b] There are three people in a room. Each person is either a knight who always tells the truth or a liar who always tells lies. The first person said «We are all liars». The second replied «Only you are a liar». Is the third person a liar or a knight? [b]p5.[/b] A $5\times 8$ rectangle is divided into forty $1\times 1$ square boxes (see the figure below). Choose 24 such boxes and one diagonal in each chosen box so that these diagonals don't have common points. $\begin{tabular}{|l|l|l|l|l|l|l|l|} \hline & & & & & & & \\ \hline & & & & & & & \\ \hline & & & & & & & \\ \hline & & & & & & & \\ \hline \end{tabular}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A sequence of positive integers with $n$ terms satisfies $\sum_{i=1}^{n} a_i=2007$. Find the least positive integer $n$ such that there exist some consecutive terms in the sequence with their sum equal to $30$.

Let ${n}$ and $k$ be positive integers. There are given ${n}$ circles in the plane. Every two of them intersect at two distinct points, and all points of intersection they determine are pairwise distinct (i. e. no three circles have a common point). No three circles have a point in common. Each intersection point must be colored with one of $n$ distinct colors so that each color is used at least once and exactly $k$ distinct colors occur on each circle. Find all values of $n\geq 2$ and $k$ for which such a coloring is possible. [i]Proposed by Horst Sewerin, Germany[/i]

We say that some positive integer $m$ covers the number $1998$, if $1,9,9,8$ appear in this order as digits of $m$. (For instance $1998$ is covered by $2\textbf{1}59\textbf{9}36\textbf{98}$ but not by $213326798$.) Let $k(n)$ be the number of positive integers that cover $1998$ and have exactly $n$ digits ($n\ge 5$), all different from $0$. What is the remainder of $k(n)$ on division by $8$?

Let $n$ be a positive integer. Find the largest integer $N$ for which there exists a set of $n$ weights such that it is possible to determine the mass of all bodies with masses of $1, 2, ..., N$ using a balance scale . (i.e. to determine whether a body with unknown mass has a mass $1, 2, ..., N$, and which namely).

A set of points on the plane is [i]antiparallelogram [/i] if any four points of the set are [b]not[/b] vertices of a parallelogram. Prove that for any set of $2023$ points on the plane, [b]no[/b] three of them are collinears, there exists a subset of $17$ points, such that this subset is antiparallelogram.

There are $12$ monsters in a plane. Each monster is capable of spraying fire in a $30$-degree cone. Prove that monsters can destroy the plane.

We are given $n$ coins of different weights and $n$ balances, $n>2$. On each turn one can choose one balance, put one coin on the right pan and one on the left pan, and then delete these coins out of the balance. It's known that one balance is wrong (but it's not known ehich exactly), and it shows an arbitrary result on every turn. What is the smallest number of turns required to find the heaviest coin? [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

The vertices of a regular $2012$-gon are labeled $A_1,A_2,\ldots, A_{2012}$ in some order. It is known that if $k+\ell$ and $m+n$ leave the same remainder when divided by $2012$, then the chords $A_kA_{\ell}$ and $A_mA_n$ have no common points. Vasya walks around the polygon and sees that the first two vertices are labeled $A_1$ and $A_4$. How is the tenth vertex labeled? [i]Proposed by A. Golovanov[/i]

A postman has to deliver five letters to five different houses. Mischievously, he posts one letter through each door without looking to see if it is the correct address. In how many different ways could he do this so that exactly two of the five houses receive the correct letters?

Nico picks $13$ pairwise distinct $3-$digit positive integers. Ian then selects several of these 13 numbers, the ones he wants, and using only once each selected number and some of the operations addition, subtraction, multiplication and division ($+,-,\times ,:$) must get an expression whose value is greater than $3$ and less than $4$. If he succeeds, Ian wins; otherwise, Nico wins. Which of the two has a winning strategy?

Let $S$ be the sum of integer weights that come with a two pan balance Scale, say $\omega_1 \le \omega_2 \le \omega_3 \le ... \le\omega_n$. Show that all integer-weighted objects in the range $1$ to $S$ can be weighed exactly if and only if $\omega_1=1$ and $$\omega_{j+1} \le 2 \left( \sum_{l=1}^{j} \omega_l\right) +1$$

Let $ x_1 , x_2, x_3 ...$ a succession of positive integers such that for every couple of positive integers $(m,n)$ we have $ x_{mn} \neq x_{m(n+1)}$ . Prove that there exists a positive integer $i$ such that $x_i \ge 2017 $.

A $ 100 \times 100$ square floor consisting of $ 10000$ squares is to be tiled by rectangular $ 1 \times 3$ tiles, fitting exactly over three squares of the floor. $ (a)$ If a $ 2 \times 2$ square is removed from the center of the floor, prove that the rest of the floor can be tiled with the available tiles. $ (b)$ If, instead, a $ 2 \times 2$ square is removed from the corner, prove that such a tiling is not possble.

Let $n\geqslant 3$ be a positive integer. A circular necklace is called [i]fun[/i] if it has $n{}$ black beads and $n{}$ white beads. A move consists of cutting out a segment of consecutive beads and reattaching it in reverse. Prove that it is possible to change any fun necklace into any other fun necklace using at most $(n-1)$ moves. [i]Note:[/i] Necklaces related by rotations or reflections are considered to be the same. [i]Proposed by Dylan Toh[/i]

Let $n$ be a positive integer. Find the smallest positive integer $k$ with the property that for any colouring nof the squares of a $2n$ by $k$ chessboard with $n$ colours, there are $2$ columns and $2$ rows such that the $4$ squares in their intersections have the same colour.

A set $A$ of positive integers is called [i]uniform[/i] if, after any of its elements removed, the remaining ones can be partitioned into two subsets with equal sum of their elements. Find the least positive integer $n>1$ such that there exist a uniform set $A$ with $n$ elements.

During a break, $n$ children at school sit in a circle around their teacher to play a game. The teacher walks clockwise close to the children and hands out candies to some of them according to the following rule: He selects one child and gives him a candy, then he skips the next child and gives a candy to the next one, then he skips 2 and gives a candy to the next one, then he skips 3, and so on. Determine the values of $n$ for which eventually, perhaps after many rounds, all children will have at least one candy each.

Five cards labeled $1, 3, 5, 7, 9$ are laid in a row in that order, forming the five-digit number $13579$ when read from left to right. A swap consists of picking two distinct cards, and then swapping them. After three swaps, the cards form a new five-digit number n when read from left to right. Compute the expected value of $n$.

Madam Mim has a deck of $52$ cards, stacked in a pile with their backs facing up. Mim separates the small pile consisting of the seven cards on the top of the deck, turns it upside down, and places it at the bottom of the deck. All cards are again in one pile, but not all of them face down; the seven cards at the bottom do, in fact, face up. Mim repeats this move until all cards have their backs facing up again. In total, how many moves did Mim make $?$

An array $ n\times n$ is given, consisting of $ n^2$ unit squares. A [i]pawn[/i] is placed arbitrarily on a unit square. The pawn can move from a square of the $ k$-th column to any square of the $ k$-th row. Show that there exists a sequence of $ n^2$ moves of the pawn so that all the unit squares of the array are visited once, the pawn returning to its original position. [b]Dinu Serbanescu[/b]