Let $ p(x)$ be a cubic polynomial with rational coefficients. $ q_1$, $ q_2$, $ q_3$, ... is a sequence of rationals such that $ q_n \equal{} p(q_{n \plus{} 1})$ for all positive $ n$. Show that for some $ k$, we have $ q_{n \plus{} k} \equal{} q_n$ for all positive $ n$.

A social club has $101$ members, each of whom is fluent in the same $50$ languages. Any pair of members always talk to each other in only one language. Suppose that there were no three members such that they use only one language among them. Let $A$ be the number of three-member subsets such that the three distinct pairs among them use different languages. Find the maximum possible value of $A$.

Uri must paint some integers from $1$ to $2022$ (inclusive) in red, such that none of the differences between two red numbers is a prime number. Determine the maximum number of numbers Uri can paint red. [b]Note 1:[/b] The [i]difference [/i]between two distinct numbers is the subtraction of the larger minus the smaller. [b]Note 2:[/b] $1$ is not a prime number.

Find the value of sum $\sum_{n=1}^\infty A_n$, where $$A_n=\sum_{k_1=1}^\infty\cdots\sum_{k_n=1}^\infty \frac{1}{k_1^2}\frac{1}{k_1^2+k_2^2}\cdots\frac{1}{k_1^2+\cdots+k_n^2}.$$

A research facility has $60$ rooms, numbered $1, 2, \dots 60$, arranged in a circle. The entrance is in room $1$ and the exit is in room $60$, and there are no other ways in and out of the facility. Each room, except for room $60$, has a teleporter equipped with an integer instruction $1 \leq i < 60$ such that it teleports a passenger exactly $i$ rooms clockwise. On Monday, a researcher generates a random permutation of $1, 2, \dots, 60$ such that $1$ is the first integer in the permutation and $60$ is the last. Then, she configures the teleporters in the facility such that the rooms will be visited in the order of the permutation. On Tuesday, however, a cyber criminal hacks into a randomly chosen teleporter, and he reconfigures its instruction by choosing a random integer $1 \leq j' < 60$ such that the hacked teleporter now teleports a passenger exactly $j'$ rooms clockwise (note that it is possible, albeit unlikely, that the hacked teleporter's instruction remains unchanged from Monday). This is a problem, since it is possible for the researcher, if she were to enter the facility, to be trapped in an endless \say{cycle} of rooms. The probability that the researcher will be unable to exit the facility after entering in room $1$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Two circles $\Gamma_1$ and $\Gamma_2$ intersect at $A,B$. Points $C,D$ lie on $\Gamma_1$, points $E,F$ lie on $\Gamma_2$ such that $A,B$ lies on segments $CE,DF$ respectively and segments $CE,DF$ do not intersect. Let $CF$ meet $\Gamma_1,\Gamma_2$ again at $K,L$ respectively, and $DE$ meet $\Gamma_1,\Gamma_2$ at $M,N$ respectively. If the circumcircles of $\triangle ALM$ and $\triangle BKN$ are tangent, prove that the radii of these two circles are equal.

Let $k$ and $n$ be positive integers. A sequence $\left( A_1, \dots , A_k \right)$ of $n\times n$ real matrices is [i]preferred[/i] by Ivan the Confessor if $A_i^2\neq 0$ for $1\le i\le k$, but $A_iA_j=0$ for $1\le i$, $j\le k$ with $i\neq j$. Show that $k\le n$ in all preferred sequences, and give an example of a preferred sequence with $k=n$ for each $n$. (Proposed by Fedor Petrov, St. Petersburg State University)

Bo, Coe, Flo, Joe, and Moe have different amounts of money. Neither Jo nor Bo has as much money as Flo. Both Bo and Coe have more than Moe. Jo has more than Moe, but less than Bo. Who has the least amount of money? $ \text{(A)}\ \text{Bo}\qquad\text{(B)}\ \text{Coe}\qquad\text{(C)}\ \text{Flo}\qquad\text{(D)}\ \text{Joe}\qquad\text{(E)}\ \text{Moe} $

Is it possible to cover the surface of a regular octahedron by several regular hexagons without gaps and overlaps? (A regular octahedron has $6$ vertices, each face is an equilateral triangle, each vertex belongs to $4$ faces.)

Suppose the prime numbers $p$ and $q$ satisfy $q^2+3p=197p^2+q$.Write $\frac{p}{q}$ as $l+\frac{m}{n}$, where $l,m,n$ are positive integers , $m<n$ and $GCD(m,n)=1$. Find the maximum value of $l+m+n$.

Inside or on the faces of a tetrahedron with five edges of length $2$ and one edge of lenght $1$, there is a point $P$ having distances $a, b, c, d$ to the four faces of the tetrahedron. Determine the locus of all points $P$ such that $a+b+c+d$ is minimal and the locus of all points $P$ such that $a+b+c+d$ is maximal.

A teacher wants to divide the $2010$ questions she asked in the exams during the school year into three folders of $670$ questions and give each folder to a student who solved all $670$ questions in that folder. Determine the minimum number of students in the class that makes this possible for all possible situations in which there are at most two students who did not solve any given question.

Suppose $P(x) = x^n + a_{n-1} x^{n-1} + \cdots + a_1x + a_0$ where $a_0, a_1, \ldots, a_{n-1}$ are reals for $n\geq 1$ (monic $n$th-degree polynomial with real coefficients). If the inequality \[ 3(P(x)+P(y)) \geq P(x+y) \] holds for all reals $x,y$, determine the minimum possible value of $P(2024)$.

Let $n$ be a positive integer. Show that there exist three distinct integers between $n^{2}$ and $n^{2}+n+3\sqrt{n}$, such that one of them divides the product of the other two.

A rectangle is inscribed in a circle of area $32\pi$ and the area of the rectangle is $34$. Find its perimeter. [i]2017 CCA Math Bonanza Individual Round #2[/i]

A set of $1985$ points is distributed around the circumference of a circle and each of the points is marked with $1$ or $-1$. A point is called “good” if the partial sums that can be formed by starting at that point and proceeding around the circle for any distance in either direction are all strictly positive. Show that if the number of points marked with $-1$ is less than $662$, there must be at least one good point.

Two regular hexagons of side length $2$ are laid on top of each other such that they share the same center point and one hexagon is rotated $30^\circ$ about the center from the other. Compute the area of the union of the two hexagons.

Wanda the Worm likes to eat Pascal's triangle. One day, she starts at the top of the triangle and eats $\textstyle\binom{0}{0}=1$. Each move, she travels to an adjacent positive integer and eats it, but she can never return to a spot that she has previously eaten. If Wanda can never eat numbers $a,b,c$ such that $a+b=c$, prove that it is possible for her to eat 100,000 numbers in the first 2011 rows given that she is not restricted to traveling only in the first 2011 rows. (Here, the $n+1$st row of Pascal's triangle consists of entries of the form $\textstyle\binom{n}{k}$ for integers $0\le k\le n$. Thus, the entry $\textstyle\binom{n}{k}$ is considered adjacent to the entries $\textstyle\binom{n-1}{k-1}$, $\textstyle\binom{n-1}{k}$, $\textstyle\binom{n}{k-1}$, $\textstyle\binom{n}{k+1}$, $\textstyle\binom{n+1}{k}$, $\textstyle\binom{n+1}{k+1}$.) [i]Linus Hamilton.[/i]

A cubic function $f(x)$ satisfies the equation $\sin 3t=f(\sin t)$ for all real numbers $t$. Evaluate $\int_0^1 f(x)^2\sqrt{1-x^2}\ dx$.

In the Quadrilateral $ABCD$ we have $ \measuredangle B=\measuredangle D = 60^\circ $.$M$ is midpoint of side $AD$.The line through $M$ parallel to $CD$ meets $BC$ at $P$.Point $X$ lying on $CD$ such that $BX=MX$.Prove that $AB=BP$ if and only if $\measuredangle MXB=60^\circ$. Author: Davoud Vakili, Iran

Let $P$ equal the product of $3,659,893,456,789,325,678$ and $342,973,489,379,256$. The number of digits in $P$ is: $\textbf{(A) }36\qquad \textbf{(B) }35\qquad \textbf{(C) }34\qquad \textbf{(D) }33\qquad \textbf{(E) }32$

$ a,b,c>0 $ and $ abc=1 $. Prove that $\frac{1}{2}\ (\sqrt{a}\ +\sqrt{b}\ + \sqrt{c}\ ) +\frac{1}{1+a}\ + \frac{1}{1+b}\ + \frac{1}{1+c}\ge\ 3 $. ( The official problem is with $ abc = 1 $ but it can be proved without using it. )

Three circles with centres A, B, C touch each other pairwise externally, and touch circle c from inside. Prove that if the centre of c coincideswith the orthocentre of triangle ABC, then ABC is equilateral.

Source: 2018 Canadian Open Math Challenge Part C Problem 4 ----- Given a positive integer $N$, Matt writes $N$ in decimal on a blackboard, without writing any of the leading 0s. Every minute he takes two consicutive digits, erases them, and replaces them with the last digit of their product. Any leading zeroes created this way are also erased. He repeats this process for as long as he likes. We call the positive integer $M$ [i]obtainable[/i] from $N$ if starting from $N$, there is a finite sequence of moves that Matt can make to produce the number $M$. For example, 10 is obtainible from 251023 via \[2510\underline{23}\rightarrow\underline{25} 106\rightarrow 1\underline{06}\rightarrow 10\] $\text{(a)}$ Show that 2018 is obtainablefrom 2567777899. $\text{(b)}$ Find two positive integers $A$ and $B$ for which there is no positive integer $C$ [color=transparent](B.)[/color] such that both $A$ and $B$ are obtainablefrom $C$ $\text{(c)}$ Let $S$ be any finite set of positive integers, none of which contains the digit 5 [color=transparent](C.)[/color] in its decimal representation. Prove that there exists a positive integer $N$ [color=transparent](C.)[/color] for which all elements of $S$ are obtainable from $N$.

Lisa and Bart are playing a game. A round table has $n$ lights evenly spaced around its circumference. Some of the lights are on and some of them off; the initial configuration is random. Lisa wins if she can get all of the lights turned on; Bart wins if he can prevent this from happening. On each turn, Lisa chooses the positions at which to flip the lights, but before the lights are flipped, Bart, knowing Lisa’s choices, can rotate the table to any position that he chooses (or he can leave the table as is). Then the lights in the positions that Lisa chose are flipped: those that are off are turned on and those that are on are turned off. Here is an example turn for $n = 5$ (a white circle indicates a light that is on, and a black circle indicates a light that is off): [asy] size(250); defaultpen(linewidth(1)); picture p = new picture; real r = 0.2; pair s1=(0,-4), s2=(0,-8); int[][] filled = {{1,2,3},{1,2,5},{2,3,4,5}}; draw(p,circle((0,0),1)); for(int i = 0; i < 5; ++i) { pair P = dir(90-72*i); filldraw(p,circle(P,r),white); label(p,string(i+1),P,2*P,fontsize(10)); } add(p); add(shift(s1)*p); add(shift(s2)*p); for(int j = 0; j < 3; ++j) for(int i = 0; i < filled[j].length; ++i) filldraw(circle(dir(90-72*(filled[j][i]-1))+j*s1,r)); label("$\parbox{15em}{Initial Position.}$", (-4.5,0)); label("$\parbox{15em}{Lisa says ``1,3,4.'' \\ Bart rotates the table one \\ position counterclockwise. }$", (-4.5,0)+s1); label("$\parbox{15em}{Lights in positions 1,3,4 are \\ flipped.}$", (-4.5,0)+s2);[/asy] Lisa can take as many turns as she needs to win, or she can give up if it becomes clear to her that Bart can prevent her from winning. (a) Show that if $n = 7$ and initially at least one light is on and at least one light is off, then Bart can always prevent Lisa from winning. (b) Show that if $n = 8$, then Lisa can always win in at most 8 turns.