Let $x_1, x_2, . . . , x_{2022}$ be nonzero real numbers. Suppose that $x_k + \frac{1}{x_{k+1}} < 0$ for each $1 \leq k \leq 2022$, where $x_{2023}=x_1$. Compute the maximum possible number of integers $1 \leq n \leq 2022$ such that $x_n > 0$.

Decompose the polynomial $$x^8 + x^4 +1$$ to factors of at most second degree.

Given positive numbers $a_1$ and $b_1$, consider the sequences defined by \[a_{n+1}=a_n+\frac{1}{b_n},\quad b_{n+1}=b_n+\frac{1}{a_n}\quad (n \ge 1)\] Prove that $a_{25}+b_{25} \geq 10\sqrt{2}$.

Two ducks, Wat and Q, are taking a math test with $1022$ other ducklings. The test has $30$ questions, and the $n$th question is worth $n$ points. The ducks work independently on the test. Wat gets the $n$th problem correct with probability $\frac{1}{n^2}$ while Q gets the $n$th problem correct with probability $\frac{1}{n+1}$. Unfortunately, the remaining ducklings each answer all $30$ questions incorrectly. Just before turning in their test, the ducks and ducklings decide to share answers! On any question which Wat and Q have the same answer, the ducklings change their answers to agree with them. After this process, what is the expected value of the sum of all $1024$ scores? [i]Proposed by Evan Chen[/i]

Call a natural number [i]simple[/i] if it is not divisible by any square of a prime number (in other words it is square-free). Prove that there are infinitely many positive integers $n$ such that both $n$ and $n+1$ are [i]simple[/i].

What is the sum of all numbers between $0$ and $511$ inclusive that have an even number of $1$s when written in binary?

Find $$ \inf_{\substack{ n\ge 1 \\ a_1,\ldots ,a_n >0 \\ a_1+\cdots +a_n <\pi }} \left( \sum_{j=1}^n a_j\cos \left( a_1+a_2+\cdots +a_j \right)\right) . $$

Let $V$ be the region in the Cartesian plane consisting of all points $(x,y)$ satisfying the simultaneous conditions $$|x|\le y\le|x|+3\text{ and }y\le4.$$Find the centroid of $V$.

Consider an infinite sequence of positive integers $a_1, a_2, a_3, \dots$ such that $a_1 > 1$ and $(2^{a_n} - 1)a_{n+1}$ is a square for all positive integers $n$. Is it possible for two terms of such a sequence to be equal? [i]Proposed by Pavel Kozlov, Russia[/i]

Convex quadrilateral $ABCD$ has right angles $\angle A$ and $\angle C$ and is such that $AB=BC$ and $AD=CD$. The diagonals $AC$ and $BD$ intersect at point $M$. Points $P$ and $Q$ lie on the circumcircle of triangle $AMB$ and segment $CD$, respectively, such that points $P$, $M$, and $Q$ are collinear. Suppose that $m\angle ABC=160^\circ$ and $m\angle QMC=40^\circ$. Find $MP\cdot MQ$, given that $MC=6$.

What is $ ( \minus{} 1)^1 \plus{} ( \minus{} 1)^2 \plus{} \cdots \plus{} ( \minus{} 1)^{2006}$? $ \textbf{(A) } \minus{} 2006 \qquad \textbf{(B) } \minus{} 1 \qquad \textbf{(C) } 0 \qquad \textbf{(D) } 1 \qquad \textbf{(E) } 2006$

Let $ABC$ be a triangle with $\angle{C} = 90^{\circ}$, and let $H$ be the foot of the altitude from $C$. A point $D$ is chosen inside the triangle $CBH$ so that $CH$ bisects $AD$. Let $P$ be the intersection point of the lines $BD$ and $CH$. Let $\omega$ be the semicircle with diameter $BD$ that meets the segment $CB$ at an interior point. A line through $P$ is tangent to $\omega$ at $Q$. Prove that the lines $CQ$ and $AD$ meet on $\omega$.

Into how many regions do $n$ circles divide the plane, if each pair of circles intersects in two points and no point lies on three circles?

Let $n$ be a fixed positive integer and fix a point $O$ in the plane. There are $n$ lines drawn passing through the point $O$. Determine the largest $k$ (depending on $n$) such that we can always color $k$ of the $n$ lines red in such a way that no two red lines are perpendicular to each other. [i]Proposed by Nikola Velov[/i]

We call a number [i]pal[/i] if it doesn't have a zero digit and the sum of the squares of the digits is a perfect square. For example, $122$ and $34$ are pal but $304$ and $12$ are not pal. Prove that there exists a pal number with $n$ digits, $n > 1$.

Let $O(0,0)$, $A(\tfrac{1}{2},0)$, and $B(0, \tfrac{\sqrt{3}}{2})$ be points in the coordinate plane. Let $\mathcal{F}$ be the family of segments $\overline{PQ}$ of unit length lying in the first quadrant with $P$ on the $x$-axis and $Q$ on the $y$-axis. There is a unique point $C$ on $\overline{AB}$, distinct from $A$ and $B$, that does not belong to any segment from $\mathcal{F}$ other than $\overline{AB}$. Then $OC^2 = \tfrac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. Find $p + q$.

Let $a$, $b$, $c$, $d$ be complex numbers satisfying \begin{align*} 5 &= a+b+c+d \\ 125 &= (5-a)^4 + (5-b)^4 + (5-c)^4 + (5-d)^4 \\ 1205 &= (a+b)^4 + (b+c)^4 + (c+d)^4 + (d+a)^4 + (a+c)^4 + (b+d)^4 \\ 25 &= a^4+b^4+c^4+d^4 \end{align*} Compute $abcd$. [i]Proposed by Evan Chen[/i]

Juku has the first $100$ volumes of the Harrie Totter book series at his home. For every$ i$ and $j$, where $1 \le i < j \le 100$, call the pair $(i, j)$ reversed if volume No. $j$ is before volume No, $i$ on Juku’s shelf. Juku wants to arrange all volumes of the series to one row on his shelf in such a way that there does not exist numbers $i, j, k$, where $1 \le i < j < k \le 100$, such that pairs $(i, j)$ and $(j, k)$ are both reversed. Find the largest number of reversed pairs that can occur under this condition

$ABC$ is an arbitrary triangle. $A',B',C'$ are midpoints of arcs $BC, AC, AB$. Sides of triangle $ABC$, intersect sides of triangle $A'B'C'$ at points $P,Q,R,S,T,F$. Prove that \[\frac{S_{PQRSTF}}{S_{ABC}}=1-\frac{ab+ac+bc}{(a+b+c)^{2}}\]

Prove for positive reals $a,b,c$ that $(ab+bc+ca+1)(a+b)(b+c)(c+a) \ge 2abc(a+b+c+1)^2$

Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$. Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$. Find a closed form for $a_n$. [i]Proposed by Bobby Shen[/i]

Two parallel lines $r,s$ and two points $P \in r$ and $Q \in s$ are given in a plane. Consider all pairs of circles $(C_P, C_Q)$ in that plane such that $C_P$ touches $r$ at $P$ and $C_Q$ touches $s$ at $Q$ and which touch each other externally at some point $T$. Find the locus of $T$.

Let $p \equiv 2 \pmod 3$ be a prime, $k$ a positive integer and $P(x) = 3x^{\frac{2p-1}{3}}+3x^{\frac{p+1}{3}}+x+1$. For any integer $n$, let $R(n)$ denote the remainder when $n$ is divided by $p$ and let $S = \{0,1,\cdots,p-1\}$. At each step, you can either (a) replaced every element $i$ of $S$ with $R(P(i))$ or (b) replaced every element $i$ of $S$ with $R(i^k)$. Determine all $k$ such that there exists a finite sequence of steps that reduces $S$ to $\{0\}$. [i]Proposed by fattypiggy123[/i]

There are $n$ boys and $n$ girls sitting around a circular table, where $n>3$. In every move, we are allowed to swap the places of $2$ adjacent children. The [b]entropy[/b] of a configuration is the minimal number of moves such that at the end of them each child has at least one neighbor of the same gender. Find the maximal possible entropy over the set of all configurations. [i]Authored by Viktor Simjanoski[/i]

Let $\mathbb{R}$ be the set of real numbers. Determine all functions $f: \mathbb{R} \to \mathbb{R}$ such that \[ f(x^2 - y^2) = x f(x) - y f(y) \] for all pairs of real numbers $x$ and $y$.