Let $\{a_k\}_{k\geq 0}$ be a sequence given by $a_0 = 0$, $a_{k+1}=3\cdot a_k+1$ for $k\in \mathbb{N}$. Prove that $11 \mid a_{155}$

Peter and Vasil together thought of ten 5-degree polynomials. Then, Vasil began calling consecutive natural numbers starting with some natural number. After each called number, Peter chose one of the ten polynomials at random and plugged in the called number. The results were recorded on the board. They eventually form a sequence. After they finished, their sequence was arithmetic. What is the greatest number of numbers that Vasil could have called out? [i]A. Golovanov[/i]

In a cyclic quadrilateral $ ABCD$ the sides $ AB$ and $ AD$ are equal, $ CD>AB\plus{}BC$. Prove that $ \angle ABC>120^\circ$.

$x_1$ is a natural constant. Prove that there does not exist any natural number $m> 2500$ such that the recursive sequence $\{x_i\} _{i=1} ^ \infty $ defined by $x_{n+1} = x_n^{s(n)} + 1$ becomes eventually periodic modulo $m$. (That is there does not exist natural numbers $N$ and $T$ such that for each $n\geq N$, $m\mid x_n - x_{n+T}$). ($s(n)$ is the sum of digits of $n$.)

The sequence $a_1, a_2, \ldots, a_n$ of positive real numbers satisfies the following conditions: \begin{align*} \sum_{i=1}^n \frac{1}{a_i} \le 1 \ \ \ \ \hbox{and} \ \ \ \ a_i \le a_{i-1}+1 \end{align*} for all $i\in \lbrace 1, 2, \ldots, n \rbrace$, where $a_0$ is an integer. Prove that \begin{align*} n \le 4a_0 \cdot \sum_{i=1}^n \frac{1}{a_i} \end{align*}

Let $ABC$ be a triangle with $AB=AC$ and let $D$ be the midpoint of $AC$. The angle bisector of $\angle BAC$ intersects the circle through $D,B$ and $C$ at the point $E$ inside the triangle $ABC$. The line $BD$ intersects the circle through $A,E$ and $B$ in two points $B$ and $F$. The lines $AF$ and $BE$ meet at a point $I$, and the lines $CI$ and $BD$ meet at a point $K$. Show that $I$ is the incentre of triangle $KAB$. [i]Proposed by Jan Vonk, Belgium and Hojoo Lee, South Korea[/i]

Find the least positive integer $n$ such that the decimal representation of the binomial coefficient $\dbinom{2n}{n}$ ends in four zero digits.

Let $k$ be a positive integer. Prove that there exists an infinite monotone increasing sequence of integers $\{a_{n}\}_{n \ge 1}$ such that \[a_{n}\; \text{divides}\; a_{n+1}^{2}+k \;\; \text{and}\;\; a_{n+1}\; \text{divides}\; a_{n}^{2}+k\] for all $n \in \mathbb{N}$.

Integers $1 \le n \le 200$ are written on a blackboard just one by one. We surrounded just $100$ integers with circle. We call a square of the sum of surrounded integers minus the sum of not surrounded integers $score$ of this situation. Calculate the average score in all ways.

An L-shape is one of the following four pieces, each consisting of three unit squares: [asy] size(300); defaultpen(linewidth(0.8)); path P=(1,2)--(0,2)--origin--(1,0)--(1,2)--(2,2)--(2,1)--(0,1); draw(P); draw(shift((2.7,0))*rotate(90,(1,1))*P); draw(shift((5.4,0))*rotate(180,(1,1))*P); draw(shift((8.1,0))*rotate(270,(1,1))*P); [/asy] A $5\times 5$ board, consisting of $25$ unit squares, a positive integer $k\leq 25$ and an unlimited supply of L-shapes are given. Two players A and B, play the following game: starting with A they play alternatively mark a previously unmarked unit square until they marked a total of $k$ unit squares. We say that a placement of L-shapes on unmarked unit squares is called $\textit{good}$ if the L-shapes do not overlap and each of them covers exactly three unmarked unit squares of the board. B wins if every $\textit{good}$ placement of L-shapes leaves uncovered at least three unmarked unit squares. Determine the minimum value of $k$ for which B has a winning strategy.

How many line segments have both their endpoints located at the vertices of a given cube? $\text{(A)}\ 12 \qquad \text{(B)}\ 15 \qquad \text{(C)}\ 24 \qquad \text{(D)}\ 28\qquad \text{(E)}\ 56$

Xenia and Sergey play the following game. Xenia thinks of a positive integer $N$ not exceeding $5000$. Then she fixes $20$ distinct positive integers $a_1, a_2, \cdots, a_{20}$ such that, for each $k = 1,2,\cdots,20$, the numbers $N$ and $a_k$ are congruent modulo $k$. By a move, Sergey tells Xenia a set $S$ of positive integers not exceeding $20$, and she tells him back the set $\{a_k : k \in S\}$ without spelling out which number corresponds to which index. How many moves does Sergey need to determine for sure the number Xenia thought of? [i]Sergey Kudrya, Russia[/i]

Csongi taught Benedek how to fold a duck in 8 steps from a $24$ cm $\times 24$ cm piece of paper. The paper is meant to be folded along the dashed line in the direction of the arrow. Once Benedek folded the duck, he undid all the steps, finding crease lines on the square sheet of paper. On one side of the paper, he drew in blue the folds which opened towards Benedek, and in red the folds which opened toward the table. How many cm is the difference between the total length of the blue lines and the red lines? [img]https://cdn.artofproblemsolving.com/attachments/0/1/358a3b2c3b959a85406b94e34c182fd1c2e28d.png[/img]

Given a positive integer $n\ge 3$, colour each cell of an $n\times n$ square array with one of $\lfloor (n+2)^2/3\rfloor$ colours, each colour being used at least once. Prove that there is some $1\times 3$ or $3\times 1$ rectangular subarray whose three cells are coloured with three different colours. [i](Russia) Ilya Bogdanov, Grigory Chelnokov, Dmitry Khramtsov[/i]

Let $p, q,$ and $r$ be the roots of the polynomial $f(t) = t^3 - 2022t^2 + 2022t - 337.$ Given $$x = (q-1)\left ( \frac{2022 - q}{r-1} + \frac{2022 - r}{p-1} \right )$$ $$y = (r-1)\left ( \frac{2022 - r}{p-1} + \frac{2022 - p}{q-1} \right )$$ $$z = (p-1)\left ( \frac{2022 - p}{q-1} + \frac{2022 - q}{r-1} \right )$$ compute $xyz - qrx - rpy - pqz.$

Sarah stands at $(0,0)$ and Rachel stands at $(6,8)$ in the Euclidena plane. Sarah can only move $1$ unit in the positive $x$ or $y$ direction, and Rachel can only move $1$ unit in the negative $x$ or $y$ direction. Each second, Sarah and Rachel see each other, independently pick a direction to move, and move to their new position. Sarah catches Rachel if Sarah and Rachel are every at the same point. Rachel wins if she is able to get $(0,0)$ without being caught; otherwise, Sarah wins. Given that both of them play optimally to maximize their probability of winning, what is the probability that Rachel wins?

Botvid left home between $4$ and $5$ for a short visit to Amanda. When he came back between $5$ and $6$, he found that the hands of the clock had changed places. What time was it?

In $xyz$ space, let $l$ be the segment joining two points $(1,\ 0,\ 1)$ and $(1,\ 0,\ 2),$ and $A$ be the figure obtained by revolving $l$ around the $z$ axis. Find the volume of the solid obtained by revolving $A$ around the $x$ axis. Note you may not use double integral.

A biologist watches a chameleon. The chameleon catches flies and rests after each catch. The biologist notices that: [list=1][*]the first fly is caught after a resting period of one minute; [*]the resting period before catching the $2m^\text{th}$ fly is the same as the resting period before catching the $m^\text{th}$ fly and one minute shorter than the resting period before catching the $(2m+1)^\text{th}$ fly; [*]when the chameleon stops resting, he catches a fly instantly.[/list] [list=a][*]How many flies were caught by the chameleon before his first resting period of $9$ minutes in a row? [*]After how many minutes will the chameleon catch his $98^\text{th}$ fly? [*]How many flies were caught by the chameleon after 1999 minutes have passed?[/list]

Let $ A $ be a ring in which $ 1\neq 0. $ If $ a,b\in A, $ then the following affirmations are equivalent: $ \text{(i)}\quad aba=a\wedge ba^2b=1 $ $ \text{(ii)}\quad ab=ba=1 $ $ \text{(iii)}\quad \exists !b\in A\quad aba=a $

On two sides of an angle, points $A, B$ are chosen. The midpoint $M$ of the segment $AB$ belongs to two lines such that one of them meets the sides of the angle at points $A_1, B_1$, and the other at points $A_2, B_2$. The lines $A_1B_2$ and $A_2B_1$ meet $AB$ at points $P$ and $Q$. Prove that $M$ is the midpoint of $PQ$.

A graph has $N$ vertices. An invisible hare sits in one of the vertices. A group of hunters tries to kill the hare. In each move all of them shoot simultaneously: each hunter shoots at a single vertex, they choose the target vertices cooperatively. If the hare was in one of the target vertices during a shoot, the hunt is finished. Otherwise the hare can stay in its vertex or jump to one of the neighboring vertices. The hunters know an algorithm that allows them to kill the hare in at most $N!$ moves. Prove that then there exists an algorithm that allows them to kill the hare in at most $2^N$ moves.

The angles at $A,B,C,D,E$ of a pentagon $ABCDE$ inscribed in a circle form an increasing sequence. Show that the angle at $C$ is greater than $\pi/2$, and that this lower bound cannot be improved.

For any real number $t$, denote by $[t]$ the greatest integer which is less than or equal to $t$. For example: $[8] = 8$, $[\pi] = 3$, and $[-5/2] = -3$. Show that the equation \[[x] + [2x] + [4x] + [8x] + [16x] + [32x] = 12345\] has no real solution.

Consider any rectangular table having finitely many rows and columns, with a real number $a(r, c)$ in the cell in row $r$ and column $c$. A pair $(R, C)$, where $R$ is a set of rows and $C$ a set of columns, is called a [i]saddle pair[/i] if the following two conditions are satisfied: [list] [*] $(i)$ For each row $r^{\prime}$, there is $r \in R$ such that $a(r, c) \geqslant a\left(r^{\prime}, c\right)$ for all $c \in C$; [*] $(ii)$ For each column $c^{\prime}$, there is $c \in C$ such that $a(r, c) \leqslant a\left(r, c^{\prime}\right)$ for all $r \in R$. [/list] A saddle pair $(R, C)$ is called a [i]minimal pair[/i] if for each saddle pair $\left(R^{\prime}, C^{\prime}\right)$ with $R^{\prime} \subseteq R$ and $C^{\prime} \subseteq C$, we have $R^{\prime}=R$ and $C^{\prime}=C$. Prove that any two minimal pairs contain the same number of rows.