Kostya and Sergey play a game on a white strip of length 2016 cells. Kostya (he plays first) in one move should paint black over two neighboring white cells. Sergey should paint either one white cell either three neighboring white cells. It is forbidden to make a move, after which a white cell is formed the doesn't having any white neighbors. Loses the one that can make no other move. However, if all cells are painted, then Kostya wins. Who will win if he plays the right game (has a winning strategy)?

The streets of the city of Duzhinsk are simple polygonal lines not intersecting each other in internal points. Each street connects two crossings and is colored in one of three colors: white, red, or blue. At each crossing exactly three streets meet, one of each color. A crossing is called positive if the streets meeting at it are white, blue and red in counterclockwise direction, and negative otherwise. Prove that the difference between the numbers of positive and negative crossings is a multiple of 4.

Two circles are tangent externaly at a point $B$. A line tangent to one of the circles at a point $A$ intersects the other circle at points $C$ and $D$. Show that $A$ is equidistant to the lines $BC$ and $BD$.

Given are the integers $a , b , c, \alpha, \beta$ and the sequence $(u_n)$ is defined by $u_1=\alpha, u_2=\beta, u_{n+2}=au_{n+1}+bu_n+c$ for all $n \geq 1$. a) Prove that if $a = 3 , b= -2 , c = -1$ then there are infinitely many pairs of integers $(\alpha ; \beta)$ so that $u_{2023}=2^{2022}$. b) Prove that there exists a positive integer $n_0$ such that only one of the following two statements is true: i) There are infinitely many positive integers $m$, such that $u_{n_0}u_{n_0+1}\ldots u_{n_0+m}$ is divisible by $7^{2023}$ or $17^{2023}$ ii) There are infinitely many positive integers $k$ so that $u_{n_0}u_{n_0+1}\ldots u_{n_0+k}-1$ is divisible by $2023$

The real numbers $a_{1},a_{2},\ldots ,a_{n}$ where $n\ge 3$ are such that $\sum_{i=1}^{n}a_{i}=0$ and $2a_{k}\le\ a_{k-1}+a_{k+1}$ for all $k=2,3,\ldots ,n-1$. Find the least $f(n)$ such that, for all $k\in\left\{1,2,\ldots ,n\right\}$, we have $|a_{k}|\le f(n)\max\left\{|a_{1}|,|a_{n}|\right\}$.

For what $\lambda$ does the equation $$ \int_{0}^{1} \min(x,y) f(y)\; dy =\lambda f(x)$$ have continuous solutions which do not vanish identically in $(0,1)?$ What are these solutions?

Let $P(x)$ be the polynomial of degree at most $6$ which satisfies $P(k)=k!$ for $k=0,1,2,3,4,5,6$. Compute the value of $P(7)$.

Finite number of dwarfs excavates ore in the mine with infinite number of levels. Each day at the same time one dwarf from each level, inhabited with exactly $n = 1, 2, 3, ...$ dwarfs, move $n$ levels down. Prove that after some moment there will be no more then one dwarf on each level.

A circle of radius $ 1$ is surrounded by $ 4$ circles of radius $ r$ as shown. What is $ r$? [asy]defaultpen(linewidth(.9pt)); real r = 1 + sqrt(2); pair A = dir(45)*(r + 1); pair B = dir(135)*(r + 1); pair C = dir(-135)*(r + 1); pair D = dir(-45)*(r + 1); draw(Circle(origin,1)); draw(Circle(A,r));draw(Circle(B,r));draw(Circle(C,r));draw(Circle(D,r)); draw(A--(dir(45)*r + A)); draw(B--(dir(45)*r + B)); draw(C--(dir(45)*r + C)); draw(D--(dir(45)*r + D)); draw(origin--(dir(25))); label("$r$",midpoint(A--(dir(45)*r + A)), SE); label("$r$",midpoint(B--(dir(45)*r + B)), SE); label("$r$",midpoint(C--(dir(45)*r + C)), SE); label("$r$",midpoint(D--(dir(45)*r + D)), SE); label("$1$",origin,W);[/asy]$ \textbf{(A)}\ \sqrt {2}\qquad \textbf{(B)}\ 1 \plus{} \sqrt {2}\qquad \textbf{(C)}\ \sqrt {6}\qquad \textbf{(D)}\ 3\qquad \textbf{(E)}\ 2 \plus{} \sqrt {2}$

Let $ M,N,P,Q $ be points on the sides $ AB,BC,CD,DA $ (respectively) of a convex quadrilateral $ ABCD $ so that: $$ \frac{MA}{MB} =\frac{NB}{NC} =\frac{PD}{PC} =\frac{QA}{QD}\neq 1 $$ Show that the area of $ MNPQ $ is half the area of $ ABCD $ if and only if $ ABD $ and $ BCD $ have equal areas. [i]Petre Asaftei[/i]

A positive integer $n$ is called nice if it has at least $3$ proper divisors and it is equal to the sum of its three largest proper divisors. For example, $6$ is nice because its largest proper divisors are $3,2,1$ and $6=3+2+1$. Find the number of nice integers not greater than $3000$.

There are three men and eleven women taking a dance class. In how many different ways can each man be paired with a woman partner and then have the eight remaining women be paired into four pairs of two?

A set $S=\{ s_1,s_2,...,s_k\}$ of positive real numbers is "polygonal" if $k\geq 3$ and there is a non-degenerate planar $k-$gon whose side lengths are exactly $s_1,s_2,...,s_k$; the set $S$ is multipolygonal if in every partition of $S$ into two subsets,each of which has at least three elements, exactly one of these two subsets in polygonal. Fix an integer $n\geq 7$. (a) Does there exist an $n-$element multipolygonal set, removal of whose maximal element leaves a multipolygonal set? (b) Is it possible that every $(n-1)-$element subset of an $n-$element set of positive real numbers be multipolygonal?

[b]p1.[/b] Let $U = \{-2, 0, 1\}$ and $N = \{1, 2, 3, 4, 5\}$. Let $f$ be a function that maps $U$ to $N$. For any $x \in U$, $x + f(x) + xf(x)$ is an odd number. How many $f$ satisfy the above statement? [b]p2.[/b] Around a circle are written all of the positive integers from $ 1$ to $n$, $n \ge 2$ in such a way that any two adjacent integers have at least one digit in common in their decimal expressions. Find the smallest $n$ for which this is possible. [b]p3.[/b] Michael loses things, especially his room key. If in a day of the week he has $n$ classes he loses his key with probability $n/5$. After he loses his key during the day he replaces it before he goes to sleep so the next day he will have a key. During the weekend(Saturday and Sunday) Michael studies all day and does not leave his room, therefore he does not lose his key. Given that on Monday he has 1 class, on Tuesday and Thursday he has $2$ classes and that on Wednesday and Friday he has $3$ classes, what is the probability that loses his key at least once during a week? [b]p4.[/b] Given two concentric circles one with radius $8$ and the other $5$. What is the probability that the distance between two randomly chosen points on the circles, one from each circle, is greater than $7$ ? [b]p5.[/b] We say that a positive integer $n$ is lucky if $n^2$ can be written as the sum of $n$ consecutive positive integers. Find the number of lucky numbers strictly less than $2015$. [b]p6.[/b] Let $A = \{3^x + 3^y + 3^z|x, y, z \ge 0, x, y, z \in Z, x < y < z\}$. Arrange the set $A$ in increasing order. Then what is the $50$th number? (Express the answer in the form $3^x + 3^y + 3^z$). [b]p7.[/b] Justin and Oscar found $2015$ sticks on the table. I know what you are thinking, that is very curious. They decided to play a game with them. The game is, each player in turn must remove from the table some sticks, provided that the player removes at least one stick and at most half of the sticks on the table. The player who leaves just one stick on the table loses the game. Justin goes first and he realizes he has a winning strategy. How many sticks does he have to take off to guarantee that he will win? [b]p8.[/b] Let $(x, y, z)$ with $x \ge y \ge z \ge 0$ be integers such that $\frac{x^3+y^3+z^3}{3} = xyz + 21$. Find $x$. [b]p9.[/b] Let $p < q < r < s$ be prime numbers such that $$1 - \frac{1}{p} -\frac{1}{q} -\frac{1}{r}- \frac{1}{s}= \frac{1}{pqrs}.$$ Find $p + q + r + s$. [b]p10.[/b] In ”island-land”, there are $10$ islands. Alex falls out of a plane onto one of the islands, with equal probability of landing on any island. That night, the Chocolate King visits Alex in his sleep and tells him that there is a mountain of chocolate on one of the islands, with equal probability of being on each island. However, Alex has become very fat from eating chocolate his whole life, so he can’t swim to any of the other islands. Luckily, there is a teleporter on each island. Each teleporter will teleport Alex to exactly one other teleporter (possibly itself) and each teleporter gets teleported to by exactly one teleporter. The configuration of the teleporters is chosen uniformly at random from all possible configurations of teleporters satisfying these criteria. What is the probability that Alex can get his chocolate? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Positive rational number $a$ and $b$ satisfy the equality \[a^3 + 4a^2b = 4a^2 + b^4.\] Prove that the number $\sqrt{a}-1$ is a square of a rational number.

Define the sequence $\{a_i\}$ by $a_0=1$, $a_1=4$, and $a_{n+1}=5a_n-a_{n-1}$ for all $n\geq 1$. Show that all terms of the sequence are of the form $c^2+3d^2$ for some integers $c$ and $d$.

A quarter of an checkered plane is given, infinite to the right and up. All its rows and columns are numbered starting from $0$. All cells with coordinates $(2n, n)$, were cut out from this figure, starting from $n = 1$. In each of the remaining cells they wrote a number, the number of paths from the corner cell to this one (you can only walk up and to the right and you cannot pass through the removed cells). Prove that for each removed cell the numbers to the left and below it differ by exactly $2$.

Let $ABC$ be a triangle. Let $X$ be the point on side $AB$ such that $\angle{BXC} = 60^{\circ}$. Let $P$ be the point on segment $CX$ such that $BP\bot AC$. Given that $AB = 6, AC = 7,$ and $BP = 4,$ compute $CP$.

If $\tan{\alpha}$ and $\tan{\beta}$ are the roots of $x^2 - px + q = 0$, and $\cot{\alpha}$ and $\cot{\beta}$ are the roots of $x^2 - rx + s = 0$, then $rs$ is necessarily $\text{(A)} \ pq \qquad \text{(B)} \ \frac{1}{pq} \qquad \text{(C)} \ \frac{p}{q^2} \qquad \text{(D)} \ \frac{q}{p^2} \qquad \text{(E)} \ \frac{p}{q}$

Eight bulbs are arranged on a circle. In every step we perform the following operation: We simultaneously switch off all those bulbs whose two neighboring bulbs are in different states, and switch on the other bulbs. Prove that after at most four steps all the bulbs will be switched on.

What is the remainder when $128^{2023}$ is divided by $126$?

On top of a thin square cake are triangular chocolate chips which are mutually disjoint. Is it possible to cut the cake into convex polygonal pieces each containing exactly one chip?

Let $p$ a positive prime number and $\mathbb{F}_{p}$ the set of integers $mod \ p$. For $x\in \mathbb{F}_{p}$, define $|x|$ as the cyclic distance of $x$ to $0$, that is, if we represent $x$ as an integer between $0$ and $p-1$, $|x|=x$ if $x<\frac{p}{2}$, and $|x|=p-x$ if $x>\frac{p}{2}$ . Let $f: \mathbb{F}_{p} \rightarrow \mathbb{F}_{p}$ a function such that for every $x,y \in \mathbb{F}_{p}$ \[ |f(x+y)-f(x)-f(y)|<100 \] Prove that exist $m \in \mathbb{F}_{p}$ such that for every $x \in \mathbb{F}_{p}$ \[ |f(x)-mx|<1000 \]

Let $ABC$ be an acute scalene triangle with $O$ as its circumcenter. Point $P$ lies inside triangle $ABC$ with $\angle PAB = \angle PBC$ and $\angle PAC = \angle PCB$. Point $Q$ lies on line $BC$ with $QA = QP$. Prove that $\angle AQP = 2\angle OQB$.

Let $P$ be a polynomial satisfying $P(x + 1) + P(x - 1) = x^3$ for all real numbers $x$. Find the value of $P(12)$.