What is $10 \cdot \left(\tfrac{1}{2} + \tfrac{1}{5} + \tfrac{1}{10}\right)^{-1}?$ ${ \textbf{(A)}\ 3\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ \frac{25}{2}\qquad\textbf{(D)}}\ \frac{170}{3}\qquad\textbf{(E)}\ 170$

Does there exist non-zero complex numbers $a, b, c$ and natural number $h$ such that if integers $k, l, m$ satisfy $|k| + |l| + |m| \geq 1996$, then $|ka + lb + mc| > \frac {1}{h}$ is true?

Is it possible to find three conics in the plane such that any straight line in the plane intersects at least two of the conics and through any point of the plane pass tangents to at least two of them?

The polynomial $x^{2n}+1+(x+1)^{2n}$ is not divisible by $x^2+x+1$ if $n$ equals $\text{(A)} \ 17 \qquad \text{(B)} \ 20 \qquad \text{(C)} \ 21 \qquad \text{(D)} \ 64 \qquad \text{(E)} \ 65$

If $A$ is the area of a triangle with perimeter $ 1$, what is the largest possible value of $A^2$?

Let $n$ be a fixed positive integer, and choose $n$ positive integers $a_1, \ldots , a_n$. Given a permutation $\pi$ on the first $n$ positive integers, let $S_{\pi}=\{i\mid \frac{a_i}{\pi(i)} \text{ is an integer}\}$. Let $N$ denote the number of distinct sets $S_{\pi}$ as $\pi$ ranges over all such permutations. Determine, in terms of $n$, the maximum value of $N$ over all possible values of $a_1, \ldots , a_n$. [i]Proposed by James Lin.[/i]

How many neutrons are in $0.025$ mol of the isotope ${ }_{24}^{54}\text{Cr}$? $ \textbf{(A)}\hspace{.05in}1.5\times10^{22} \qquad\textbf{(B)}\hspace{.05in}3.6\times10^{23} \qquad\textbf{(C)}\hspace{.05in}4.5\times10^{23} \qquad\textbf{(D)}\hspace{.05in}8.1\times10^{23} \qquad $

In the following diagram, $AB = 1$. The radius of the circle with center $C$ can be expressed as $\frac{p}{q}$. Determine $p+q$. [i]2022 CCA Math Bonanza Lightning Round 3.2[/i]

Let $\Gamma$ be a circle in the plane and $S$ be a point on $\Gamma$. Mario and Luigi drive around the circle $\Gamma$ with their go-karts. They both start at $S$ at the same time. They both drive for exactly $6$ minutes at constant speed counterclockwise around the circle. During these $6$ minutes, Luigi makes exactly one lap around $\Gamma$ while Mario, who is three times as fast, makes three laps. While Mario and Luigi drive their go-karts, Princess Daisy positions herself such that she is always exactly in the middle of the chord between them. When she reaches a point she has already visited, she marks it with a banana. How many points in the plane, apart from $S$, are marked with a banana by the end of the $6$ minutes.

Find all triples $ (x,y,z)$ of real numbers that satisfy the system of equations \[ \begin{cases}x^3 \equal{} 3x\minus{}12y\plus{}50, \\ y^3 \equal{} 12y\plus{}3z\minus{}2, \\ z^3 \equal{} 27z \plus{} 27x. \end{cases}\] [i]Razvan Gelca.[/i]

This figure is cut out from a sheet of paper. Folding the sides upwards along the dashed lines, one gets a (non-equilateral) pyramid with a square base. Calculate the area of the base. [img]https://1.bp.blogspot.com/-lPpfHqfMMRY/XzcBIiF-n2I/AAAAAAAAMW8/nPs_mLe5C8srcxNz45Wg-_SqHlRAsAmigCLcBGAsYHQ/s0/2005%2BMohr%2Bp1.png[/img]

Alice and Bob now play a magic show. There are $101 $ different hats lie on the table and they form a circle. Firstly, Bob choose a positive integer $n$(Alice doesn’t know it). Then Bob puts a rabbit under one of the hats and Alice doesn’t know which hat contains the rabbit. Each time, she can choose a hat and see whether the rabbit is under the hat. If not, then Bob will move the rabbit from the current hat to the $n$th hat in a clockwise direction. They will repeat these steps until Alice find the rabbit. Prove that Alice can find the rabbit in $201$ steps.

A rogue spaceship escapes. $54$ minutes later the police leave in a spaceship in hot pursuit. If the police spaceship travels $12% $ faster than the rogue spaceship along the same route, how many minutes will it take for the police to catch up with the rogues?

Prove that if a quadrilateral $ABCD$ can be cut into a finite number of parallelograms, then $ABCD$ is a parallelogram.

Given is a cyclic quadrilateral $ABCD$ with $|AB| = |BC|$. Point $E$ is on the arc $CD$ where $A$ and $B$ are not on. Let $P$ be the intersection point of $BE$ and $CD$ , let $Q$ be the intersection point of $AE$ and $BD$ . Prove that $PQ \parallel AC$.

Two circles have radius $9$, and one circle has radius $7$. Each circle is externally tangent to the other two circles, and each circle is internally tangent to two sides of an isosceles triangle, as shown. The sine of the base angle of the triangle is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [img]https://cdn.artofproblemsolving.com/attachments/7/f/c34ff6bcaf6f07e6ba81a7d256e15a61f0e1fa.png[/img]

The pages of a notebook are numbered consecutively so that the numbers $1$ and $2$ are on the second sheet, numbers $3$ and $4$, and so on. A sheet is torn out of this notebook. All of the remaining page numbers are addedand have sum $2021$. (a) How many pages could the notebook originally have been? (b) What page numbers can be on the torn sheet? (Walther Janous)

Let $G$ be a finite group of order $n$. Define the set \[H=\{x:x\in G\text{ and }x^2=e\},\] where $e$ is the neutral element of $G$. Let $p=|H|$ be the cardinality of $H$. Prove that a) $|H\cap xH|\ge 2p-n$, for any $x\in G$, where $xH=\{xh:h\in H\}$. b) If $p>\frac{3n}{4}$, then $G$ is commutative. c) If $\frac{n}{2}<p\le\frac{3n}{4}$, then $G$ is non-commutative. [i]Marian Andronache[/i]

Let $\mathbb{Z}^+$ be the set of positive integers. Determine all functions $f : \mathbb{Z}^+\to\mathbb{Z}^+$ such that $a^2+f(a)f(b)$ is divisible by $f(a)+b$ for all positive integers $a,b$.

A list of $11$ positive integers has a mean of $10$, a median of $9$, and a unique mode of $8$. What is the largest possible value of an integer in the list? ${ \textbf{(A)}\ 24\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 31\qquad\textbf{(D)}}\ 33\qquad\textbf{(E)}\ 35 $

The function $g$ is defined about the natural numbers and satisfies the following conditions: $g(2) = 1$ $g(2n) = g(n)$ $g(2n+1) = g(2n) +1.$ Where $n$ is a natural number such that $1 \leq n \leq 2002$. Find the maximum value $M$ of $g(n).$ Also, calculate how many values of $n$ satisfy the condition of $g(n) = M.$

Suppose $a$, $b$, $c$, and $d$ are positive real numbers that satisfy the system of equations \begin{align*}(a+b)(c+d)&=143,\\(a+c)(b+d)&=150,\\(a+d)(b+c)&=169.\end{align*} Compute the smallest possible value of $a^2+b^2+c^2+d^2$.

$2014$ points are placed on a circumference. On each of the segments with end points on two of the $2014$ points is written a non-negative real number. For any convex polygon with vertices on some of the $2014$ points, the sum of the numbers written on their sides is less or equal than $1$. Find the maximum possible value for the sum of all the written numbers.

Find all function $f,g: \mathbb{Q} \to \mathbb{Q}$ such that \[\begin{array}{l} f\left( {g\left( x \right) - g\left( y \right)} \right) = f\left( {g\left( x \right)} \right) - y \\ g\left( {f\left( x \right) - f\left( y \right)} \right) = g\left( {f\left( x \right)} \right) - y \\ \end{array}\] for all $x,y \in \mathbb{Q}$.

For $n>2$, an $n\times n$ grid of squares is coloured black and white like a chessboard, with its upper left corner coloured black. Then we can recolour some of the white squares black in the following way: choose a $2\times 3$ (or $3\times 2$) rectangle which has exactly $3$ white squares and then colour all these $3$ white squares black. Find all $n$ such that after a series of such operations all squares will be black.