A rabbit initially stands at the position $0$, and repeatedly jumps on the real line. In each jump, the rabbit can jump to any position corresponds to an integer but it cannot stand still. Let $N(a)$ be the number of ways to jump with a total distance of $2019$ and stop at the position $a$. Determine all integers $a$ such that $N(a)$ is odd.

Show that the recursion $n=x_n(x_{n-1}+x_n+x_{n+1})$, $n=1,2,\ldots$, $x_0=0$ has exaclty one nonnegative solution. (translated by L. Erdős)

A sequence $(a_n)_{n\ge0}$ satisfies $a_{m+n}+a_{m-n}=\frac12\left(a_{2m}+a_{2n}\right)$ for all integers $m,n$ with $m\ge n\ge0$. Given that $a_1=1$, find $a_{2003}$.

Does there exist a function $f: \mathbb R \to \mathbb R $ satisfying the following conditions: (i) for each real $y$ there is a real $x$ such that $f(x)=y$ , and (ii) $f(f(x)) = (x - 1)f(x) + 2$ for all real $x$ ? [i]Proposed by Igor I. Voronovich, Belarus[/i]

Define a sequence $\{a_n\}_{n \geq 1}$ recursively by $a_1=1$, $a_2=2$, and for all integers $n \geq 2$, $a_{n+1}=(n+1)^{a_n}$. Determine the number of integers $k$ between $2$ and $2020$, inclusive, such that $k+1$ divides $a_k - 1$. [i]Proposed by Taiki Aiba[/i]

Is it possible to divide $5$ apples of the same size equally between six children so that no apple will be cut into more than $3$ pieces? (You are allowed to cut an apple into any number of equal pieces).

Together, the two positive integers $a$ and $b$ have $9$ digits and contain each of the digits $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly once. For which possible values of $a$ and $b$ is the fraction $a/b$ closest to $1$?

$m$ boys and $n$ girls ($m>n$) sat across a round table, supervised by a teacher, and they did a game, which went like this. At first, the teacher pointed a boy to start the game. The chosen boy put a coin on the table. Then, consecutively in a clockwise order, everyone did his turn. If the next person is a boy, he will put a coin to the existing pile of coins. If the next person is a girl, she will take a coin from the existing pile of coins. If there is no coin on the table, the game ends. Notice that depending on the chosen boy, the game could end early, or it could go for a full turn. If the teacher wants the game to go for at least a full turn, how many possible boys could be chosen? [i]Hendrata Dharmawan, Boston, USA[/i]

Let $ABC$ be a triangle with circumcenter $O$ and incenter $I$, and suppose that $OI$ meets $AB$ and $AC$ at $P$ and $Q$, respectively. There exists a point $R$ on arc $\widehat{BAC}$ such that the circumcircles of triangles $PQR$ and $ABC$ are tangent. Given that $AB = 14$, $BC = 20$, and $CA = 26$, find $\frac{RC}{RB}$. [i]Proposed by Andrew Wu[/i]

Let $N=34 \cdot 34 \cdot 63 \cdot 270$. What is the ratio of the sum of the odd divisors of $N$ to the sum of the even divisors of $N$? $\textbf{(A) }1:16 \qquad \textbf{(B) }1:15 \qquad \textbf{(C) }1:14 \qquad \textbf{(D) }1:8 \qquad \textbf{(E) }1:3$

[b]a.)[/b] Let $a,b$ be real numbers. Define sequence $x_k$ and $y_k$ such that \[x_0 = 1, y_0 = 0, x_{k+1} = a \cdot x_k - b \cdot y_l, \quad y_{k+1} = x_k - a \cdot y_k \text{ for } k = 0,1,2, \ldots \] Prove that \[x_k = \sum^{[k/2]}_{l=0} (-1)^l \cdot a^{k - 2 \cdot l} \cdot \left(a^2 + b \right)^l \cdot \lambda_{k,l}\] where $\lambda_{k,l} = \sum^{[k/2]}_{m=l} \binom{k}{2 \cdot m} \cdot \binom{m}{l}$ [b]b.)[/b] Let $u_k = \sum^{[k/2]}_{l=0} \lambda_{k,l} $. For positive integer $m,$ denote the remainder of $u_k$ divided by $2^m$ as $z_{m,k}$. Prove that $z_{m,k},$ $k = 0,1,2, \ldots$ is a periodic function, and find the smallest period.

$25$ lightbulbs are distributed in the following way: the first $24$ are placed on a circumference, placing a bulb at each vertex of a regular $24$-gon, and the remaining bulb is placed on the center of said circumference. At any time, the following operations may be applied: [list] [*] Take two vertices on the circumference with an odd amount of vertices between them, and change the state of the bulbs on those vertices and the center bulb. [*] Take three vertices on the circumference that form an equilateral triangle, change the state of the bulbs on those vertices and the center bulb.[/list] Prove from any starting configuration of on and off lightbulbs, it is always possible to reach a configuration where all the bulbs are on.

If one uses only the tabular information $10^3=1000$, $10^4=10,000$, $2^{10}=1024$, $2^{11}=2048$, $2^{12}=4096$, $2^{13}=8192$, then the strongest statement one can make for $\log_{10}{2}$ is that it lies between: $\textbf{(A)}\ \frac{3}{10} \; \text{and} \; \frac{4}{11}\qquad \textbf{(B)}\ \frac{3}{10} \; \text{and} \; \frac{4}{12}\qquad \textbf{(C)}\ \frac{3}{10} \; \text{and} \; \frac{4}{13}\qquad \textbf{(D)}\ \frac{3}{10} \; \text{and} \; \frac{40}{132}\qquad \textbf{(E)}\ \frac{3}{11} \; \text{and} \; \frac{40}{132}$

Let $S$ be a finite set with $n{}$ $(n>1)$ elements, $M{}$ the set of all subsets of $S{}$ and a function $f:M\rightarrow\mathbb{R}$, that verifies the relation $f(A\cap B)=\min\{f(A),f(B)\}, \forall A,B\in M$. Show that $$\sum_{A\in M} (-1)^{n-|A|}\cdot f(A)=f(S)-\max\{f(A)|A\in M, A\neq S\},$$ where$|A|$ is the number of elements of subset $A{}$.

[b]6.1[/b] Which number is greater $$\underbrace{1000. . . 001}_{1965\, zeroes} / \underbrace{1000 . . . 001}_{1966\, zeroes} \,\,\, or \,\,\, \underbrace{1000. . . 001}_{1966\, zeroes} / \underbrace{1000 . . . 001}_{1967\, zeroes} \,\,?$$ [b]6.2[/b] $30$ teams participate in the football championship. Prove that at any moment there will be two teams that have played at this point the same number of matches. [b]6.3./ 7.1 [/b] All integers from $1$ to $1966$ are written on the board. Allowed is to erase any two numbers by writing their difference instead. Prove that repeating such an operation many times cannot ensure that There are only zeros left on the board. [b]6.4 / 7.5[/b] Black paint was sprayed onto a white surface. Prove that there are three points of the same color lying on the same line, and so, that one of the points lies in the middle between the other two. [b]6.5[/b] In a chess tournament, there are more than three chess players, and each player plays each other the same number of times. There were $26$ rounds in the tournament. After the $13$th round, one of the participants discovered that he had an odd number points, and each of the other participants has an even number of points. How many chess players participated in the tournament? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988082_1966_leningrad_math_olympiad]here[/url].

It is known that in a group of $2024$ students each student has at least $1011$ acquaintances among the remaining members of the group. What is more, there exists a student that has at least $1012$ acquaintances in the group. Prove that for every pair of students $X, Y$, there exist students $X_0 = X, X_1, ..., X_{n - 1}, X_n = Y$ in the group such that for every index $i = 0, ..., n - 1$, the students $X_i$ and $X_{i + 1}$ are acquaintances. [i]Proposed by Mirko Petruševski[/i]

a) For each $n \ge 2$, find the maximum constant $c_{n}$ such that $\frac 1{a_{1}+1}+\frac 1{a_{2}+1}+\ldots+\frac 1{a_{n}+1}\ge c_{n}$ for all positive reals $a_{1},a_{2},\ldots,a_{n}$ such that $a_{1}a_{2}\cdots a_{n}= 1$. b) For each $n \ge 2$, find the maximum constant $d_{n}$ such that $\frac 1{2a_{1}+1}+\frac 1{2a_{2}+1}+\ldots+\frac 1{2a_{n}+1}\ge d_{n}$ for all positive reals $a_{1},a_{2},\ldots,a_{n}$ such that $a_{1}a_{2}\cdots a_{n}= 1$.

Compute the number of permutations of $\{1,2,3\}$ with the property that there is some number that can be removed such that the remaining numbers are in increasing order. For example, $(2,1,3)$ has this property because removing $1$ leaves $(2,3)$, which is in increasing order. [i]2020 CCA Math Bonanza Team Round #1[/i]

Let the circles $\omega$ and $\omega'$ intersect in points $A$ and $B$. The tangent to circle $\omega$ at $A$ intersects $\omega'$ at $C$ and the tangent to circle $\omega'$ at $A$ intersects $\omega$ at $D$. Suppose that the internal bisector of $\angle CAD$ intersects $\omega$ and $\omega'$ at $E$ and $F$, respectively, and the external bisector of $\angle CAD$ intersects $\omega$ and $\omega'$ at $X$ and $Y$, respectively. Prove that the perpendicular bisector of $XY$ is tangent to the circumcircle of triangle $BEF$. [i]Proposed by Mahdi Etesami Fard[/i]

The set $S$ contains nine numbers. The mean of the numbers in $S$ is $202.$ The mean of the five smallest of the numbers in $S$ is $100.$ The mean of the five largest numbers in $S$ is $300.$ What is the median of the numbers in $S?$

There are $ n$ football teams in a round-robin competition where every 2 teams meet once. The winner of each match receives 3 points while the loser receives 0 points. In the case of a draw, both teams receive 1 point each. Let $ k$ be as follows: $ 2 \leq k \leq n \minus{} 1$. At least how many points must a certain team get in the competition so as to ensure that there are at most $ k \minus{} 1$ teams whose scores are not less than that particular team's score?

Problems 14, 15 and 16 involve Mrs. Reed's English assignment. A Novel Assignment The students in Mrs. Reed's English class are reading the same 760-page novel. Three friends, Alice, Bob and Chandra, are in the class. Alice reads a page in 20 seconds, Bob reads a page in 45 seconds and Chandra reads a page in 30 seconds. Chandra and Bob, who each have a copy of the book, decide that they can save time by "team reading" the novel. In this scheme, Chandra will read from page 1 to a certain page and Bob will read from the next page through page 760, finishing the book. When they are through they will tell each other about the part they read. What is the last page that Chandra should read so that she and Bob spend the same amount of time reading the novel? $ \textbf{(A)}\ 425 \qquad \textbf{(B)}\ 444 \qquad \textbf{(C)}\ 456 \qquad \textbf{(D)}\ 484 \qquad \textbf{(E)}\ 506$

Let $G$ be a finite set of real $n \times n$ matrices $\left\{M_{i}\right\}, 1 \leq i \leq r,$ which form a group under matrix multiplication. Suppose that $\textstyle\sum_{i=1}^{r} \operatorname{tr}\left(M_{i}\right)=0,$ where $\operatorname{tr}(A)$ denotes the trace of the matrix $A .$ Prove that $\textstyle\sum_{i=1}^{r} M_{i}$ is the $n \times n$ zero matrix.

Let $R$ be the rectangle on the cartesian plane with vertices $(0,0)$, $(5,0)$, $(5,7)$, and $(0,7)$. Find the number of squares with sides parallel to the axes and vertices that are lattice points that lie within the region bounded by $R$. [i]Proposed by Boyan Litchev[/i] [hide=Solution][i]Solution[/i]. $\boxed{85}$ We have $(6-n)(8-n)$ distinct squares with side length $n$, so the total number of squares is $5 \cdot 7+4 \cdot 6+3 \cdot 5+2 \cdot 4+1\cdot 3 = \boxed{85}$.[/hide]

In an urn there are one ball marked $1$, two balls marked $2$, and so on, up to $n$ balls marked $n$. Two balls are randomly drawn without replacement. Find the probability that the two balls are assigned the same number.