The function $f:\mathbb{N} \rightarrow \mathbb{N}$ verifies: $1) f(n+2)-2022 \cdot f(n+1)+2021 \cdot f(n)=0, \forall n \in \mathbb{N};$ $2) f(20^{22})=f(22^{20});$ $3) f(2021)=2022$. Find all possible values of $f(2022)$.

Evin and Jerry are playing a game with a pile of marbles. On each players' turn, they can remove $2$, $3$, $7$, or $8$ marbles. If they can’t make a move, because there's $0$ or $1$ marble left, they lose the game. Given that Evin goes first and both players play optimally, for how many values of $n$ from $1$ to $1434$ does Evin lose the game? [i]Proposed by Evin Liang[/i] [hide=Solution][i]Solution.[/i] $\boxed{573}$ Observe that no matter how many marbles a one of them removes, the next player can always remove marbles such that the total number of marbles removed is $10$. Thus, when the number of marbles is a multiple of $10$, the first player loses the game. We analyse this game based on the number of marbles modulo $10$: If the number of marbles is $0$ modulo $10$, the first player loses the game If the number of marbles is $2$, $3$, $7$, or $8$ modulo $10$, the first player wins the game by moving to $0$ modulo 10 If the number of marbles is $5$ modulo $10$, the first player loses the game because every move leads to $2$, $3$, $7$, or $8$ modulo $10$ In summary, the first player loses if it is $0$ mod 5, and wins if it is $2$ or $3$ mod $5$. Now we solve the remaining cases by induction. The first player loses when it is $1$ modulo $5$ and wins when it is $4$ modulo $5$. The base case is when there is $1$ marble, where the first player loses because there is no move. When it is $4$ modulo $5$, then the first player can always remove $3$ marbles and win by the inductive hypothesis. When it is $1$ modulo $5$, every move results in $3$ or $4$ modulo $5$, which allows the other player to win by the inductive hypothesis. Thus, Evin loses the game if n is $0$ or $1$ modulo $5$. There are $\boxed{573}$ such values of $n$ from $1$ to $1434$.[/hide]

$ABCD$ is a trapezoid with $AB \parallel CD$. The diagonals intersect at $P$. Let $\omega _1$ be a circle passing through $B$ and tangent to $AC$ at $A$. Let $\omega _2$ be a circle passing through $C$ and tangent to $BD$ at $D$. $\omega _3$ is the circumcircle of triangle $BPC$. Prove that the common chord of circles $\omega _1,\omega _3$ and the common chord of circles $\omega _2, \omega _3$ intersect each other on $AD$. [i]Proposed by Kasra Ahmadi[/i]

A solid has a cylindrical middle with a conical cap at each end. The height of each cap equals the length of the middle. For a given surface area, what shape maximizes the volume?

A square $ ABCD$ of side length $ 2$ is given on a plane. The segment $ AB$ is moved continuously towards $ CD$ until $ A$ and $ C$ coincide with $ C$ and $ D$, respectively. Let $ S$ be the area of the region formed by the segment $ AB$ while moving. Prove that $ AB$ can be moved in such a way that $ S <\frac{5\pi}{6}$.

In this problem we consider so-called [i]cartesian triangles[/i], that is, triangles $ABC$ with integer sides $BC=a,CA=b,AB=c$ and $\angle A=\frac{2\pi}3$. Unless noted otherwise, $\triangle ABC$ is assumed to be cartesian. (a) If $U,V,W$ are the projections of the orthocenter $H$ to $BC,CA,AB$, respectively, specify which of the segments $AU$, $BV$, $CW$, $HA$, $HB$, $HC$, $HU$, $HV$, $HW$, $AW$, $AV$, $BU$, $BW$, $CV$, $CU$ have rational length. (b) If $I$ is the incenter, $J$ the excenter across $A$, and $P,Q$ the intersection points of the two bisectors at $A$ with the line $BC$, specify those of the segments $PB$, $PC$, $QB$, $QC$, $AI$, $AJ$, $AP$, $AQ$ having rational length. (c) Assume that $b$ and $c$ are prime. Prove that exactly one of the numbers $a+b-c$ and $a-b+c$ is a multiple of $3$. (d) Assume that $\frac{a+b-c}{3c}=\frac pq$, where $p$ and $q$ are coprime, and denote by $d$ the $\gcd$ of $p(3p+2q)$ and $q(2p+q)$. Compute $a,b,c$ in terms of $p,q,d$. (e) Prove that if $q$ is not a multiple of $3$, then $d=1$. (f) Deduce a necessary and sufficient condition for a triangle to be cartesian with coprime integer sides, and by geometrical observations derive an analogous characterization of triangles $ABC$ with coprime sides $BC=a$, $CA=b$, $AB=c$ and $\angle A=\frac\pi3$.

Three equally spaced parallel lines intersect a circle, creating three chords of lengths $38, 38,$ and $34.$ What is the distance between two adjacent parallel lines? $\textbf{(A)}\ 5\frac{1}{2} \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 6\frac{1}{2} \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 7\frac{1}{2}$

Place a pebble at each [i]non-positive[/i] integer point on the real line, and let $n$ be a fixed positive integer. At each step we choose some n consecutive integer points, remove one of the pebbles located at these points and rearrange all others arbitrarily within these points (placing at most one pebble at each point). Determine whether there exists a positive integer $n$ such that for any given $N > 0$ we can place a pebble at a point with coordinate greater than $N$ in a finite number of steps described above.

Let $ABC$ be a triangle with $\angle A=\tfrac{135}{2}^\circ$ and $\overline{BC}=15$. Square $WXYZ$ is drawn inside $ABC$ such that $W$ is on $AB$, $X$ is on $AC$, $Z$ is on $BC$, and triangle $ZBW$ is similar to triangle $ABC$, but $WZ$ is not parallel to $AC$. Over all possible triangles $ABC$, find the maximum area of $WXYZ$.

Tim has a multiset of positive integers. Let $c_i$ be the number of occurrences of numbers that are [i]at least[/i] $i$ in the multiset. Let $m$ be the maximum element of the multiset. Tim calls a multiset [i]spicy[/i] if $c_1, \dots, c_m$ is a sequence of strictly decreasing powers of $3$. Tim calls the [i]hotness[/i] of a spicy multiset the sum of its elements. Find the sum of the hotness of all spicy multisets that satisfy $c_1 = 3^{2020}$. Give your answer $\pmod{1000}$. (Note: a multiset is an unordered set of numbers that can have repeats) [i]Proposed by Timothy Qian[/i]

In a certain city only simple (pairwise) exchanges of apartments are allowed (if two families exchange fiats , they are not allowed to participate in another exchange on the same day). Prove that any compound exchange may be effected in two days. It is assumed that under any exchange (simple or comp ound) each family occupies one fiat before and after the exchange and the family cannot split up . (A . Shnirelman , N .N . Konstantinov)

[b]1.[/b] Consider in the plane a set $H$ of pairwise disjoint circles of radius 1 such that, for infinitely many positive integers $n$, the circle $k_n$ with centre at the origin and of radius $n$ contains at least $cn^2$ elements of the set $H$. Prove that there exists a straight line which intersects infinitely many of the circles of $H$. Show further that if we require only that the circles $k_n$ contain o(n²) elements of $H$, the proposition will be false. [b](G. 5)[/b]

The quadratic polynomials $f$ and $g$ with real coefficients are such that if $g(x)$ is an integer for some $x>0$, then so is $f(x)$. Prove that there exist integers $m,n$ such that $f(x)=mg(x)+n$ for all $x$.

Players $A$ and $B$ play a game with $N \geq 2012$ coins and $2012$ boxes arranged around a circle. Initially $A$ distributes the coins among the boxes so that there is at least $1$ coin in each box. Then the two of them make moves in the order $B,A,B,A,\ldots $ by the following rules: [b](a)[/b] On every move of his $B$ passes $1$ coin from every box to an adjacent box. [b](b)[/b] On every move of hers $A$ chooses several coins that were [i]not[/i] involved in $B$'s previous move and are in different boxes. She passes every coin to an adjacent box. Player $A$'s goal is to ensure at least $1$ coin in each box after every move of hers, regardless of how $B$ plays and how many moves are made. Find the least $N$ that enables her to succeed.

Suppose that $f:[0,1]\to\mathbb R$ is a continuously differentiable function such that $f(0)=f(1)=0$ and $f(a)=\sqrt3$ for some $a\in(0,1)$. Prove that there exist two tangents to the graph of $f$ that form an equilateral triangle with an appropriate segment of the $x$-axis.

Let $O$ be the circumcenter and $H$ the orthocenter of an acute triangle $ABC$. Prove that the area of one of the triangles $AOH$, $BOH$ and $COH$ is equal to the sum of the areas of the other two.

In square $ABCD$ (labeled clockwise), let $P$ be any point on $BC$ and construct square $APRS$ (labeled clockwise). Prove that line $CR$ is tangent to the circumcircle of triangle $ABC$.

The plane is covered with circles in such a way that the center of each circle does not belong to any other circle. Prove that each point of the plane belongs to at most five circles.

There are many cities in penguin's land. A road runs between some of them, which either can be one or two lanes. When two streets meet outside of a city, it becomes prevent traffic chaos by building a bridge and avoiding any junctions. Now the penguin parliament has passed a new law, according to which every street is only a one-way street may be used. The Minister of Transport now liked the direction of each street stipulate that in each city at most one lane more or less leads in and out. He also knows that the streets of every city have odd number of tracks. Show that he can succeed in his endeavor.

Let $r$ be a positive integer, and let $a_0 , a_1 , \cdots $ be an infinite sequence of real numbers. Assume that for all nonnegative integers $m$ and $s$ there exists a positive integer $n \in [m+1, m+r]$ such that \[ a_m + a_{m+1} +\cdots +a_{m+s} = a_n + a_{n+1} +\cdots +a_{n+s} \] Prove that the sequence is periodic, i.e. there exists some $p \ge 1 $ such that $a_{n+p} =a_n $ for all $n \ge 0$.

Let $f:\mathbb{R} \to \mathbb{R}$ a continuos function and $\alpha$ a real number such that $$\lim_{x\to\infty}f(x) = \lim_{x\to-\infty}f(x) = \alpha.$$ Prove that for any $r > 0,$ there exists $x,y \in \mathbb{R}$ such that $y-x = r$ and $f(x) = f(y).$

Find the smallest positive integer $n$ that satisfies the following: We can color each positive integer with one of $n$ colors such that the equation $w + 6x = 2y + 3z$ has no solutions in positive integers with all of $w, x, y$ and $z$ having the same color. (Note that $w, x, y$ and $z$ need not be distinct.)

Positive integers $ a$, $ b$, $ c$, and $ d$ satisfy $ a > b > c > d$, $ a \plus{} b \plus{} c \plus{} d \equal{} 2010$, and $ a^2 \minus{} b^2 \plus{} c^2 \minus{} d^2 \equal{} 2010$. Find the number of possible values of $ a$.

A girl and a guy are going to arrive at a train station. If they arrive within 10 minutes of each other, they will instantly fall in love and live happily ever after. But after 10 minutes, whichever one arrives first will fall asleep and they will be forever alone. The girl will arrive between 8 AM and 9 AM with equal probability. The guy will arrive between 7 AM and 8:30 AM, also with equal probability. Let $\frac pq$ for $p$, $q$ coprime be the probability that they fall in love. Find $p + q$.

Alice the ant starts at vertex $A$ of regular hexagon $ABCDEF$ and moves either right or left each move with equal probability. After $35$ moves, what is the probability that she is on either vertex $A$ or $C$? [i]2015 CCA Math Bonanza Lightning Round #5.3[/i]