Asteroids A and B have circular orbits around the same star. Asteroid A is located 400 km away from the star and takes 8000 hours to complete one full revolution. Asteroid B is located 100 km away and the speed of Asteroid B is twice the speed of Asteroid A. Find how long it takes for Asteroid B to complete one full revolution in hours. [i]2022 CCA Math Bonanza Individual Round #1[/i]

Let $n$ be a positive integer. We are given a $3n \times 3n$ board whose unit squares are colored in black and white in such way that starting with the top left square, every third diagonal is colored in black and the rest of the board is in white. In one move, one can take a $2 \times 2$ square and change the color of all its squares in such way that white squares become orange, orange ones become black and black ones become white. Find all $n$ for which, using a finite number of moves, we can make all the squares which were initially black white, and all squares which were initially white black. Proposed by [i]Boris Stanković and Marko Dimitrić, Bosnia and Herzegovina[/i]

Consider the infinite grid of lattice points in $\mathbb{Z}^3$. Little D and Big Z play a game, where Little D first loses a shoe on an unmunched point in the grid. Then, Big Z munches a shoe-free plane perpendicular to one of the coordinate axes. They continue to alternate turns in this fashion, with Little D's goal to lose a shoe on each of $n$ consecutive lattice points on a line parallel to one of the coordinate axes. Determine all $n$ for which Little D can accomplish his goal. [i]David Yang.[/i]

A; B; C; D are the vertices of a square, and P is a point on the arc CD of its circumcircle. Prove that $ |PA|^2 - |PB|^2 = |PB|.|PD| -|PA|.|PC| $ Can anyone here find the solution? I'm not great with geometry, so i tried turning it into co-ordinate geometry equations, but sadly to no avail. Thanks in advance.

Misha is currently taking a Complexity Theory exam, but he seems to have forgotten a lot of the material! In the question, he is asked to fill in the following boxes with $\subseteq$ and $\subsetneq$ to identify the relationship between different complexity classes: $$\mathsf{NL}\ \fbox{\phantom{tt}}\ \mathsf{P}\ \fbox{\phantom{tt}}\ \mathsf{NP}\ \fbox{\phantom{tt}}\ \mathsf{PH}\ \fbox{\phantom{tt}}\ \mathsf{PSPACE}\ \fbox{\phantom{tt}}\ \mathsf {EXP}$$ and $$\mathsf{coNL}\ \fbox{\phantom{tt}}\ \mathsf{P}\ \fbox{\phantom{tt}}\ \mathsf{coNP}\ \fbox{\phantom{tt}}\ \mathsf{PH}$$ Luckily, he remembers that $\mathsf{P} \neq \mathsf{EXP}$, $\mathsf{NL} \neq \mathsf{PSPACE}$, $\mathsf{coNL} \neq \mathsf{PSPACE}$, and $\mathsf{NP} \neq \mathsf{coNP}\implies \mathsf{P}\neq \mathsf{NP} \land \mathsf{P}\neq \mathsf{coNP}$. How many ways are there for him to fill in the boxes so as not to contradict what he remembers?

Let $n \ge 0$ be an integer. A sequence $a_0,a_1,a_2,...$ of integers is defined as follows: we have $a_0 = n$ and for $k \ge 1, a_k$ is the smallest integer greater than $a_{k-1}$ for which $a_k +a_{k-1}$ is the square of an integer. Prove that there are exactly $\lfloor \sqrt{2n}\rfloor$ positive integers that cannot be written in the form $a_k - a_{\ell}$ with $k > \ell\ge 0$.

Compute the number of distinct pairs of the form \[(\text{first three digits of }x,\text{ first three digits of }x^4)\] over all integers $x>10^{10}$. For example, one such pair is $(100,100)$ when $x=10^{10^{10}}$.

How many pairs of positive integers $(x,y)$ are there such that $\sqrt{xy}-71\sqrt x + 30 = 0$? $ \textbf{(A)}\ 8 \qquad\textbf{(B)}\ 18 \qquad\textbf{(C)}\ 72 \qquad\textbf{(D)}\ 2130 \qquad\textbf{(E)}\ \text{Infinitely many} $

Let $a,b,c \ge 0$. Prove that $$\frac{(1+a^2)(1+b^2)(1+c^2)}{(1+a)(1+b)(1+c)}\ge \frac12 (1+abc)$$

Let $\vartriangle ABC$ be isosceles with $AB = AC$. Let $\omega$ be its circumscribed circle and $O$ its circumcenter. Let $D$ be the second intersection of $CO$ with $\omega$. Take a point $E$ in $AB$ such that $DE \parallel AC$ and suppose that $AE: BE = 2: 1$. Show that $\vartriangle ABC$ is equilateral.

Find all positive real numbers $\lambda$ such that every sequence $a_1, a_2, \ldots$ of positive real numbers satisfying \[ a_{n+1}=\lambda\cdot\frac{a_1+a_2+\ldots+a_n}{n} \] for all $n\geq 2024^{2024}$ is bounded. [i]Remark:[/i] A sequence $a_1,a_2,\ldots$ of positive real numbers is \emph{bounded} if there exists a real number $M$ such that $a_i<M$ for all $i=1,2,\ldots$

Find all pairs of polynomials $p(x),q(x)\in R[x]$ satisfying the equality $p(x^2)=p(x)q(1-x)+p(1-x)q(x)$ for all real $x$. I.Voronovich

Let $I$ be the incenter of $\triangle ABC$ and let $H_a$, $H_b$, and $H_c$ be the orthocenters of $\triangle BIC$ , $\triangle CIA$, and $\triangle AIB$, respectively. The lines $H_aH_b$ meets $AB$ at $X$ and the line $H_aH_c$ meets $AC$ at $Y$. If the midpoint $T$ of the median $AM$ of $\triangle ABC$ lies on $XY$, prove that the line $H_aT$ is perpendicular to $BC$

Find all real solutions: $$\begin{cases}a^3=2024bc \\ b^3=2024cd \\ c^3=2024da \\ d^3=2024ab \end{cases}$$

Two semicircles touch the side of the rectangle, each other and the segment drawn in it as in the figure. What part of the whole rectangle is filled? [img]https://cdn.artofproblemsolving.com/attachments/3/e/70ca8b80240a282553294a58cb3ed807d016be.png[/img]

Let $0 < a < \frac{\pi}{2}$ and $x_1,x_2,...,x_n$ be real numbers such that $\sin x_1 + \sin x_2 +... + \sin x_n \ge n \cdot sin a $. Prove that $\sin (x_1 - a) + \sin (x_2 - a) + ... + \sin (x_n - a) \ge 0$ .

Let $A_1A_2 ...A_{360}$ be a regular $360$-gon with centre $S$. For each of the triangles $A_1A_{50}A_{68}$ and $A_1A_{50}A_{69}$ determine, whether its images under some $120$ rotations with centre $S$ can have (as triangles) all the $360$ points $A_1, A_2, ..., A_{360}$ as vertices.

A rectangle $ABCD$ has side lengths $AB=6 \text{ miles}$ and $BC=9\text{ miles}.$ A pigeon hovers at point $P$, which is 5 miles above some randomly chosen point inside $ABCD$. Given that the expected value of \[AP^2+CP^2-BP^2-DP^2\] can be expressed as $\tfrac{a}{b}$, what is $ab$? [i]2022 CCA Math Bonanza Lightning Round 2.2[/i]

A [i]lattice point[/i] is a point in the plane whose two coordinates are both integers. A [i]lattice line[/i] is a line in the plane that contains at least two lattice points. Is it possible to color every lattice point red or blue such that every lattice line contains exactly 2017 red lattice points? Prove that your answer is correct.

Let $x,y,z$ be real numbers that satisfy \[x+y+z= 3 \ \ \text{ and } \ \ xy+yz+zx= a\]where $a$ is a real parameter. Find the value of $a$ for which the difference between the maximum and minimum possible values of $x$ equals $8$.

How many positive integers less than $1000$ have the property that the sum of the digits of each such number is divisible by $7$ and the number itself is divisible by $3$?

How many ordered pairs of integers $(m, n)$ satisfy the equation $m^2+mn+n^2=m^2n^2$? $\textbf{(A) }7\qquad\textbf{(B) }1\qquad\textbf{(C) }3\qquad\textbf{(D) }6\qquad\textbf{(E) }5$

Two circles have radius 5 and 26. The smaller circle passes through center of the larger one. What is the difference between the lengths of the longest and shortest chords of the larger circle that are tangent to the smaller circle? [i]Ray Li.[/i]

Let $n$ and $k$ be relatively prime positive integers with $k<n$. Each number in the set $M=\{1,2,3,\ldots,n-1\}$ is colored either blue or white. For each $i$ in $M$, both $i$ and $n-i$ have the same color. For each $i\ne k$ in $M$ both $i$ and $|i-k|$ have the same color. Prove that all numbers in $M$ must have the same color.

Nine positive integers $a_1,a_2,...,a_9$ have their last $2$-digit part equal to $11,12,13,14,15,16,17,18$ and $19$ respectively. Find the last $2$-digit part of the sum of their squares.