An urn contains $n$ balls labeled $1, 2, ... , n$. We draw the balls out one by one (without replacing them) until we obtain a ball whose number is divisible by $k$. Find all $k$ such that the expected number of balls removed is $k$.

Suppose $S$ is a subset of $\{1, 2, 3, 4, 5, 6, 7\}$. How many different possible values are there for the product of the elements in $S$?

There are $2^n$ words of length $n$ over the alphabet $\{0, 1\}$. Prove that the following algorithm generates the sequence $w_0, w_1, \ldots, w_{2^n-1}$ of all these words such that any two consecutive words differ in exactly one digit. (1) $w_0 = 00 \ldots 0$ ($n$ zeros). (2) Suppose $w_{m-1} = a_1a_2 \ldots a_n,\quad a_i \in \{0, 1\}$. Let $e(m)$ be the exponent of $2$ in the representation of $n$ as a product of primes, and let $j = 1 + e(m)$. Replace the digit $a_j$ in the word $w_{m-1}$ by $1 - a_j$. The obtained word is $w_m$.

$n$ squares of the infinite cross-lined sheet of paper are painted with black colour (others are white). Every move all the squares of the sheet change their colour simultaneously. The square gets the colour, that had the majority of three ones: the square itself, its neighbour from the right side and its neighbour from the upper side. a) Prove that after the finite number of the moves all the black squares will disappear. b) Prove that it will happen not later than on the $n$-th move

Let $P$ be a cyclic polygon with circumcenter $O$ that does not lie on any diagonal, and let $S$ be the set of points on 2D plane containing $P$ and $O$. The $\textit{Matcha Sweep Game}$ is a game between two players $A$ and $B$, with $A$ going first, such that each choosing a nonempty subset $T$ of points in $S$ that has not been previously chosen, and such that if $T$ has at least $3$ vertices then $T$ forms a convex polygon. The game ends with all points have been chosen, with the player picking the last point wins. For which polygons $P$ can $A$ guarantee a win? [i]Proposed by Anzo Teh Zhao Yang[/i]

There are $2n$ different numbers in a row. By one move we can interchange any two numbers or interchange any $3$ numbers cyclically (choose $a,b,c$ and place $a$ instead of $b$, $b$ instead of $c$, $c$ instead of $a$). What is the minimal number of moves that is always sufficient to arrange the numbers in increasing order ?

Let $n$ be a positive integer and consider an arrangement of $2n$ blocks in a straight line, where $n$ of them are red and the rest blue. A swap refers to choosing two consecutive blocks and then swapping their positions. Let $A$ be the minimum number of swaps needed to make the first $n$ blocks all red and $B$ be the minimum number of swaps needed to make the first $n$ blocks all blue. Show that $A+B$ is independent of the starting arrangement and determine its value.

Determine all positive integers $n$, $n\ge2$, such that the following statement is true: If $(a_1,a_2,...,a_n)$ is a sequence of positive integers with $a_1+a_2+\cdots+a_n=2n-1$, then there is block of (at least two) consecutive terms in the sequence with their (arithmetic) mean being an integer.

Let $F$ be the set of all $n-tuples$ $(A_1,A_2,…,A_n)$ such that each $A_i$ is a subset of ${1,2,…,2019}$. Let $\mid{A}\mid$ denote the number of elements o the set $A$ . Find $\sum_{(A_1,…,A_n)\in{F}}^{}\mid{A_1\cup{A_2}\cup...\cup{A_n}}\mid$

$1989$ equal circles are arbitrarily placed on the table without overlap. What is the least number of colors are needed such that all the circles can be painted with any two tangential circles colored differently.

We have a stick of length $2n{}$ and a machine which cuts sticks of length $k\in\mathbb{N}$ with $k>1$ into two sticks with arbitrary positive integer lengths. What is the smallest number of cuts after which we can always find some sticks whose lengths sum up to $n{}$?

[b]p1.[/b] Suppose $A$, $B$ and $C$ are the angles of a triangle. Prove that $$1 - 8 \cos A\cos B \cos C = sin^2(B - C) + (cos(B - C) - 2 cosA)^2.$$ [b]p2.[/b] Let $x_1, x_2,..., x_{100}$ be integers whose values are either $0$ or $1$. (a) Show that $$x_1 + x_2 + ... + x_{100} - (x_1x_2 + x_2x_3 + ... + x_{99}x_{100} + x_{100}x_1)\le 50.$$ (b) Give specific values for $x_1, x_2,..., x_{100}$ that give equality. [b]p3.[/b] Let $ABCD$ be a trapezoid whose area is $32$ square meters. Suppose the lengths of the parallel segments $AB$ and $DC$ are $2$ meters and $6$ meters, respectively, and $P$ is the intersection of the diagonals $AC$ and $BD$. If a line through $P$ intersects $AD$ and $BC$ at $E$ and $F$, respectively, determine, with a proof, the minimum possible area for quadrilateral $ABFE$. [b]p4.[/b] Let $n$ be a positive integer and $x$ be a real number. Show that $$\lfloor nx \rfloor = \lfloor x \rfloor +\left\lfloor x + \frac{1}{n} \right\rfloor + \left\lfloor x + \frac{2}{n} \right\rfloor + ... + \left\lfloor x + \frac{n - 1}{n} \right\rfloor$$ where $\lfloor a \rfloor$ is the greatest integer less than or equal to $a$. (For example, $\lfloor 4.5\rfloor = 4$ and $\lfloor - 4.5 \rfloor = -5$.) [b]p5.[/b] A $3n$-digit positive integer (in base $10$) containing no zero is said to be [i]quad-perfect[/i] if the number is a perfect square and each of the three numbers obtained by viewing the first $n$ digits, the middle $n$ digits and the last $n$ digits as three $n$-digit numbers is in itself a perfect square. (For example, when $n = 1$, the only quad-perfect numbers are $144$ and $441$.) Find all $9$-digit quad-perfect numbers. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The integers from $1$ to $25,$ inclusive, are randomly placed into a $5$ by $5$ grid such that in each row, the numbers are increasing from left to right. If the columns from left to right are numbered $1,2,3,4,$ and $5,$ then the expected column number of the entry $23$ can be written as $\tfrac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a+b.$

Along a circle are $100$ white points. An integer $k$ is given, where $2 \le k \le 50$. In each move, we choose a block of $k$ adjacent points such that the first and the last are white, and we paint both of them black. For which values of $k$ is it possible for us to paint all $100$ points black after $50$ moves?

Every city in the certain state is connected by airlines with no more than with three other ones, but one can get from every city to every other city changing a plane once only or directly. What is the maximal possible number of the cities?

In the lake, there are $23$ stones arranged along a circle. There are $22$ frogs numbered $1, 2, \cdots, 22$ (each number appears once). Initially, each frog randomly sits on a stone (several frogs might sit on the same stone). Every minute, all frogs jump at the same time as follows: the frog number $i$ jumps $i$ stones forward in the clockwise direction. (In particular, the frog number $22$ jumps $1$ stone in the counter-clockwise direction.) Prove that at some point, at least $6$ stones will be empty.

There are two piles of stones: $1703$ stones in one pile and $2022$ in the other. Sasha and Olya play the game, making moves in turn, Sasha starts. Let before the player's move the heaps contain $a$ and $b$ stones, with $a \geq b$. Then, on his own move, the player is allowed take from the pile with $a$ stones any number of stones from $1$ to $b$. A player loses if he can't make a move. Who wins? Remark: For 10.4, the initial numbers are $(444,999)$

We are given a polyhedron with at least $5$ vertices, such that exactly $3$ edges meet in each of the vertices. Prove that we can assign a rational number to every vertex of the given polyhedron such that the following conditions are met: $(i)$ At least one of the numbers assigned to the vertices is equal to $2020$. $(ii)$ For every polygonal face, the product of the numbers assigned to the vertices of that face is equal to $1$.

On the real number line, paint red all points that correspond to integers of the form $81x+100y$, where $x$ and $y$ are positive integers. Paint the remaining integer point blue. Find a point $P$ on the line such that, for every integer point $T$, the reflection of $T$ with respect to $P$ is an integer point of a different colour than $T$.

A white equilateral triangle $T$ with side length $2022$ is divided into equilateral triangles with side $1$ (cells) by lines parallel to the sides of $T$. We'll call two cells $\textit{adjacent}$ if they have a common vertex. Ivan colours some of the cells in black. Without knowing which cells are black, Peter chooses a set $S$ of cells and Ivan tells him the parity of the number of black cells in $S$. After knowing this, Peter is able to determine the parity of the number of $\textit{adjacent}$ cells of different colours. Find all possible cardinalities of $S$ such that this is always possible independent of how Ivan chooses to colour the cells.

There are $64$ booths around a circular table and on each one there is a chip. The chips and the corresponding booths are numbered $1$ to $64$ in this order. At the center of the table there are $1996$ light bulbs which are all turned off. Every minute the chips move simultaneously in a circular way (following the numbering sense) as follows: chip $1$ moves one booth, chip $2$ moves two booths, etc., so that more than one chip can be in the same booth. At any minute, for each chip sharing a booth with chip $1$ a bulb is lit. Where is chip $1$ on the first minute in which all bulbs are lit?

A polygon is given in which any two adjacent sides are perpendicular. We call its two vertices non-friendly if the bisectors of the polygon emerging from these vertices are perpendicular. Prove that for any vertex the number of vertices that are not friends with it is even.

In each of the squares of an $n \times n$ board, with $n \ge 3$, a positive integer is written in such a way that the absolute value of the difference of the numbers written in any two neighboring cells is less than or equal to $2$ (two neighboring cells are those that have a common side). a) Show a $5 \times 5$ board on which $15$ integers have been written different following the indicated rule. b) Find, as a function of $n$, the maximum number of different numbers that can have the board of $n \times n$ squares.

A game is played with two players and an initial stack of $n$ pennies $(n \geq 3)$. The players take turns choosing one of the stacks of pennies on the table and splitting it into two stacks. The winner is the player who makes a move that causes all stacks to be of height $1$ or $2.$ For which starting values of n does the player who goes first win, assuming best play by both players?

A total of $2010$ coins are distributed in $5$ boxes. At the beginning the quantities of coins in the boxes are consecutive natural numbers. Martha should choose and take one of the boxes, but before that she can do the following transformation finitely many times: from a box with at least 4 coins she can transfer one coin to each of the other boxes. What is the maximum number of coins that Martha can take away?