Find the smallest positive integer $n$ that is divisible by $100$ and has exactly $100$ divisors.

A square cake of uniform height is evenly covered with frosting on the top and all four sides. Find a way to cut the cake into five portions such that: (a) All portions contain the same amount of cake. (b) All portions contain the same amount of cake and frosting.

If you take a subset of $4002$ numbers from the whole numbers $1$ to $6003$, then there is always a subset of $2001$ numbers within that subset with the following property: If you order the $2001$ numbers from small to large, the numbers are alternately even and odd (or odd and even). Prove this.

Given an integer $n\ge\ 3$, find the least positive integer $k$, such that there exists a set $A$ with $k$ elements, and $n$ distinct reals $x_{1},x_{2},\ldots,x_{n}$ such that $x_{1}+x_{2}, x_{2}+x_{3},\ldots, x_{n-1}+x_{n}, x_{n}+x_{1}$ all belong to $A$.

Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$

Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.

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

In a country, the time for presidential elections has approached. There are exactly 20 million voters in the country, of which only one percent supports the current president, Miraflores. Naturally, he wants to be elected again, but on the other hand, he wants the elections to seem democratic. Miraflores established the following voting process: all the voters are divided into several equal groups, then each of these groups is again divided into a number of equal groups, and so on. In the smallest groups, a representative is chosen. Then, the chosen electors choose representatives in the second-smallest groups, to vote in an even larger group, and so on. Finally, the representatives of the largest groups choose the president. Miraflores divides voters into groups as he wants and instructs his supporters how to vote. Will he be able to organize the elections in such a way that he will be elected president? (If the votes are equal, the opposition wins.) [i]From the 32nd Moscow Mathematical Olympiad[/i]

Does there exist a piecewise linear continuous function $f:\mathbb{R}\to \mathbb{R}$ such that for any two-way infinite sequence $a_n\in[0,1]$, $n\in\mathbb{Z}$, there exists an $x\in\mathbb{R}$ with \[ \limsup_{K\to \infty} \frac{\#\{k\le K\,:\, k\in\mathbb{N},f^k(x)\in[n,n+1)\}}{K}=a_n \] for all $n\in\mathbb{Z}$, where $f^k=f\circ f\circ \dots\circ f$ stands for the $k$-fold iterate of $f$?

There are $100$ diamonds on the pile, $50$ of which are genuine and $50$ false. We invited a peculiar expert who alone can recognize which are which. Every time we show him some three diamonds, he would pick two and tell (truthfully) how many of them are genuine . Decide whether we can surely detect all genuine diamonds regardless how the expert chooses the pairs to be considered.

A “large” circular disk is attached to a vertical wall. It rotates clockwise with one revolution per minute. An insect lands on the disk and immediately starts to climb vertically upward with constant speed $\frac{\pi}{3}$ cm per second (relative to the disk). Describe the path of the insect [i](a)[/i] relative to the disk; [i](b)[/i] relative to the wall.

For positive integer $n,$ let $a_n=\sum_{k=0}^{[\frac{n}{2}]}\binom{n-2}{k}(-\frac{1}{4})^k.$ Find $a_{1997}.$ (For real $x,$ $[x]$ is defined as largest integer that does not exceeds $x.$)

On each cell of a $2005\times2005$ chessboard, there is a marker. In each move, we are allowed to remove a marker that is a neighbor to an even number of markers (but at least one). Two markers are considered neighboring if their cells share a vertex. (a) Find the least number $n$ of markers that we can end up with on the chessboard. (b) If we end up with this minimum number $n$ of markers, prove that no two of them will be neighboring.

There exist right triangles with integer side lengths such that the legs differ by $ 1$. For example, $3-4-5$ and $20-21-29$ are two such right triangles. What is the perimeter of the next smallest Pythagorean right triangle with legs differing by $ 1$?

On a \(4 \times 4\) board, each cell is colored either black or white such that each row and each column have an even number of black cells. How many ways can the board be colored?

A set of lines in the plan is called [i]nice [/i]i f every line in the set intersects an odd number of other lines in the set. Determine the smallest integer $k \ge 0$ having the following property: for each $2018$ distinct lines $\ell_1, \ell_2, ..., \ell_{2018}$ in the plane, there exist lines $\ell_{2018+1},\ell_{2018+2}, . . . , \ell_{2018+k}$ such that the lines $\ell_1, \ell_2, ..., \ell_{2018+k}$ are distinct and form a [i]nice [/i] set.

Each number of the set $\{1,2, 3,4,5,6, 7,8\}$ is colored red or blue, following the following rules: (a) Number $4$ is colored red, and there is at least one blue number, (b) if two numbers $x,y$ have different colors and $x + y \le 8$, so the number $x + y$ is colored blue, (c) if two numbers $x,y$ have different colors and $x \cdot y \le 8$, then the number $x \cdot y$ is colored red. Find all the possible ways to color this set.

At a circular track, $10$ cyclists started from some point at the same time in the same direction with different constant speeds. If any two cyclists are at some point at the same time again, we say that they meet. No three or more of them have met at the same time. Prove that by the time every two cyclists have met at least once, each cyclist has had at least $25$ meetings.

Three $n\times n$ squares form the figure $\Phi$ on the checkered plane as shown on the picture. (Neighboring squares are tpuching along the segment of length $n-1$.) Find all $n > 1$ for which the figure $\Phi$ can be covered with tiles $1\times 3$ and $3\times 1$ without overlapping.[img]https://pp.userapi.com/c850332/v850332712/115884/DKxvALE-sAc.jpg[/img]

Let ${n}$ be a fixed positive integer. ${A}$ and ${B}$ play the following game: $2023$ coins marked $1, 2, \dots, 2023$ lie on a circle (the marks are considered in module $2023$) and each coin has two sides. Initially, all coins are head up and ${A}$'s goal is to make as many coins with tail up. In each operation, ${A}$ choose two coins marked ${k}$ and $k+3$ with head up (if ${A}$ can't choose, the game ends) and ${B}$ choose a coin marked $k+1$ or $k+2$ and flip it. If at some moment there are ${n}$ coins with tail up, ${A}$ wins. Find the largest ${n}$ such that ${A}$ has a winning strategy.

On the evening of Halloween a group of $n$ kids collected $k$ bars of chocolate of the same type. At the end of the evening they wanted to divide the bars so that everybody gets the same amount of chocolate, and none of the bars is broken into more than two pieces. For which $n$ and $k$ is this possible?

In how many ways can we construct a square with dimensions $3\times 3$ using $3$ white, $3$ green and $3$ red squares of dimensions $1\times 1$, such that in every horizontal and in every certical line, squares have different colours .

Three (not necessarily distinct) points in the plane which have integer coordinates between $ 1$ and $2020$, inclusive, are chosen uniformly at random. The probability that the area of the triangle with these three vertices is an integer is $a/b$ in lowest terms. If the three points are collinear, the area of the degenerate triangle is $0$. Find $a + b$.

In the following, a [i]word[/i] will mean a finite sequence of letters "$a$" and "$b$". The [i]length[/i] of a word will mean the number of the letters of the word. For instance, $abaab$ is a word of length $5$. There exists exactly one word of length $0$, namely the empty word. A word $w$ of length $\ell$ consisting of the letters $x_1$, $x_2$, ..., $x_{\ell}$ in this order is called a [i]palindrome[/i] if and only if $x_j=x_{\ell+1-j}$ holds for every $j$ such that $1\leq j\leq\ell$. For instance, $baaab$ is a palindrome; so is the empty word. For two words $w_1$ and $w_2$, let $w_1w_2$ denote the word formed by writing the word $w_2$ directly after the word $w_1$. For instance, if $w_1=baa$ and $w_2=bb$, then $w_1w_2=baabb$. Let $r$, $s$, $t$ be nonnegative integers satisfying $r + s = t + 2$. Prove that there exist palindromes $A$, $B$, $C$ with lengths $r$, $s$, $t$, respectively, such that $AB=Cab$, if and only if the integers $r + 2$ and $s - 2$ are coprime.

Given $m+n$ numbers: $a_i,$ $i = 1,2, \ldots, m,$ $b_j$, $j = 1,2, \ldots, n,$ determine the number of pairs $(a_i,b_j)$ for which $|i-j| \geq k,$ where $k$ is a non-negative integer.