On a 30 question test, Question 1 is worth one point, Question 2 is worth two points, and so on up to Question 30. David takes the test and afterward finds out he answered nine of the questions incorrectly. However, he was not told which nine were incorrect. What is the highest possible score he could have attained? [i] Proposed by David Altizio [/i]

Let $n$ be a positive integer. Find the largest integer $N$ for which there exists a set of $n$ weights such that it is possible to determine the mass of all bodies with masses of $1, 2, ..., N$ using a balance scale . (i.e. to determine whether a body with unknown mass has a mass $1, 2, ..., N$, and which namely).

In each vertex of a regular $n$-gon $A_1A_2...A_n$ there is a unique pawn. In each step it is allowed: 1. to move all pawns one step in the clockwise direction or 2. to swap the pawns at vertices $A_1$ and $A_2$. Prove that by a finite series of such steps it is possible to swap the pawns at vertices: a) $A_i$ and $A_{i+1}$ for any $ 1 \leq i < n$ while leaving all other pawns in their initial place b) $A_i$ and $A_j$ for any $ 1 \leq i < j \leq n$ leaving all other pawns in their initial place. [i]Proposed by Matija Bucic[/i]

On complex plane, path equation of moving point $Z_1$ is $|Z_1-Z_0|=|Z_1|$, where $Z_0(Z_0\neq0)$ is a fixed point. Another moving point $Z$ satisfies that $ZZ_1=-1$. Find the path of $Z$ and describe its location and shape.

In the figure below, semicircles with centers at $A$ and $B$ and with radii $2$ and $1$, respectively, are drawn in the interior of, and sharing bases with, a semicircle with diameter $\overline{JK}$. The two smaller semicircles are externally tangent to each other and internally tangent to the largest semicircle. A circle centered at $P$ is drawn externally tangent to the two smaller semicircles and internally tangent to the largest semicircle. What is the radius of the circle centered at $P$? [asy] size(8cm); draw(arc((0,0),3,0,180)); draw(arc((2,0),1,0,180)); draw(arc((-1,0),2,0,180)); draw((-3,0)--(3,0)); pair P = (-1,0)+(2+6/7)*dir(36.86989); draw(circle(P,6/7)); dot((-1,0)); dot((2,0)); dot((-3,0)); dot((3,0)); dot(P); label("$J$",(-3,0),W); label("$A$",(-1,0),NW); label("$B$",(2,0),NE); label("$K$",(3,0),E); label("$P$",P,NW); [/asy] $ \textbf{(A)}\ \frac{3}{4} \qquad \textbf{(B)}\ \frac{6}{7} \qquad\textbf{(C)}\ \frac{1}{2}\sqrt{3} \qquad\textbf{(D)}\ \frac{5}{8}\sqrt{2} \qquad\textbf{(E)}\ \frac{11}{12} $

Find the value of $1 \cdot 2 \cdot 3 \cdot 4 + 2\cdot3\cdot4\cdot5 + \dots + 6\cdot7\cdot8\cdot9$.

The numbers from 1 to $n^2$ are randomly arranged in the cells of a $n \times n$ square ($n \geq 2$). For any pair of numbers situated on the same row or on the same column the ratio of the greater number to the smaller number is calculated. Let us call the [b]characteristic[/b] of the arrangement the smallest of these $n^2\left(n-1\right)$ fractions. What is the highest possible value of the characteristic ?

Suppose that $ a$ and $ b$ are are nonzero real numbers, and that the equation $ x^2\plus{}ax\plus{}b\equal{}0$ has solutions $ a$ and $ b$. Then the pair $ (a,b)$ is $ \textbf{(A)}\ (\minus{}2,1) \qquad \textbf{(B)}\ (\minus{}1,2) \qquad \textbf{(C)}\ (1,\minus{}2) \qquad \textbf{(D)}\ (2,\minus{}1) \qquad \textbf{(E)}\ (4,4)$

Let $F$ is the set of all sequences $\{(a_1, a_2, . . . , a_{2020})\}$ with $a_i \in \{-1, 1\}$ for all $i = 1,2,...,2020$. Prove that there exists a set $S$, such that $S \subset F$, $|S| = 2020$ and for any $(a_1,a_2,...,a_{2020}) \in F$ there exists $(b_1,b_2,...,b_{2020}) \in S$, such that $\sum_{i=1}^{2020} a_ib_i = 0$.

Decide whether it is possible to cover the $3$-dimensional Euclidean space with lines which are pairwise skew (i.e. not coplanar).

In circle $ O$, the midpoint of radius $ OX$ is $ Q$; at $ Q$, $ \overline{AB} \perp \overline{XY}$. The semi-circle with $ \overline{AB}$ as diameter intersects $ \overline{XY}$ in $ M$. Line $ \overline{AM}$ intersects circle $ O$ in $ C$, and line $ \overline{BM}$ intersects circle $ O$ in $ D$. Line $ \overline{AD}$ is drawn. Then, if the radius of circle $ O$ is $ r$, $ AD$ is: [asy]defaultpen(linewidth(.8pt)); unitsize(2.5cm); real m = 0; real b = 0; pair O = origin; pair X = (-1,0); pair Y = (1,0); pair Q = midpoint(O--X); pair A = (Q.x, -1*sqrt(3)/2); pair B = (Q.x, -1*A.y); pair M = (Q.x + sqrt(3)/2,0); m = (B.y - M.y)/(B.x - M.x); b = (B.y - m*B.x); pair D = intersectionpoint(Circle(O,1),M--(1.5,1.5*m + b)); m = (A.y - M.y)/(A.x - M.x); b = (A.y - m*A.x); pair C = intersectionpoint(Circle(O,1),M--(1.5,1.5*m + b)); draw(Circle(O,1)); draw(Arc(Q,sqrt(3)/2,-90,90)); draw(A--B); draw(X--Y); draw(B--D); draw(A--C); draw(A--D); dot(O);dot(M); label("$B$",B,NW); label("$C$",C,NE); label("$Y$",Y,E); label("$D$",D,SE); label("$A$",A,SW); label("$X$",X,W); label("$Q$",Q,SW); label("$O$",O,SW); label("$M$",M,NE+2N);[/asy]$ \textbf{(A)}\ r\sqrt {2} \qquad \textbf{(B)}\ r\qquad \textbf{(C)}\ \text{not a side of an inscribed regular polygon}\qquad \textbf{(D)}\ \frac {r\sqrt {3}}{2}\qquad \textbf{(E)}\ r\sqrt {3}$

Ivan has a $m \times n$ board, and he color some squares black, so that no three black squares form a L-triomino up to rotations and reflections. What is the maximal number of black squares that Ivan can color? [i]Proposed by Ivan Chan Kai Chin[/i]

Let $ABC$ be an acute-angled triangle with $AC \neq BC$, and let $O$ be the circumcentre and $F$ the foot of the altitude through $C$. Furthermore, let $X$ and $Y$ be the feet of the perpendiculars dropped from $A$ and $B$ respectively to (the extension of) $CO$. The line $FO$ intersects the circumcircle of $FXY$ a second time at $P$. Prove that $OP<OF$.

Several diagonals in a convex $n$-gon are drawn so as to divide the $n$-gon into triangles and: (i) the number of diagonals drawn at each vertex is even; (ii) no two of the diagonals have a common interior point. Prove that $n$ is divisible by $3$.

Given $n\in\mathbb N_+,n\ge 3,a_1,a_2,\cdots ,a_n\in\mathbb R_+.$ Let $b_1,b_2,\cdots ,b_n\in\mathbb R_+$ satisfy that for $\forall k\in\{1,2,\cdots ,n\},$ $$\sum_{\substack{i,j\in\{1,2,\cdots ,n\}\backslash \{k\}\\i\neq j}}a_ib_j=0.$$ Prove that $b_1=b_2=\cdots =b_n=0.$

Let $\vartriangle ABC$ be an isosceles triangle with $AC = BC$. Points $D, E, F$ are considered on $BC, CA, AB$, respectively, such that $AF> BF$ and that the quadrilateral $CEFD$ is a parallelogram. The perpendicular line to $BC$ drawn by $B$ intersects the perpendicular bisector of $AB$ at $G$. Prove that $DE \perp FG$.

Three lines are drawn parallel to each of the three sides of $\triangle ABC$ so that the three lines intersect in the interior of $ABC$. The resulting three smaller triangles have areas $1$, $4$, and $9$. Find the area of $\triangle ABC$. [asy] defaultpen(linewidth(0.7)); size(120); pair relpt(pair P, pair Q, real a, real b) { return (a*Q+b*P)/(a+b); } pair B = (0,0), C = (1,0), A = (0.3, 0.8), D = relpt(relpt(A,B,3,3),relpt(A,C,3,3),1,2); draw(A--B--C--cycle); label("$A$",A,N); label("$B$",B,S); label("$C$",C,S); filldraw(relpt(A,B,2,4)--relpt(A,B,3,3)--D--cycle, gray(0.7)); filldraw(relpt(A,C,1,5)--relpt(A,C,3,3)--D--cycle, gray(0.7)); filldraw(relpt(C,B,2,4)--relpt(B,C,1,5)--D--cycle, gray(0.7));[/asy]

Find consecutive integers bounding the expression \[\frac{1}{x_1 + 1}+\frac{1}{x_2 + 1}+\frac{1}{x_3 + 1}+...
+\frac{1}{x_{2001} + 1}+\frac{1}{x_{2002} + 1}\] where $x_1 = 1/3$ and $x_{n+1} = x_n^2 + x_n.$

A right pyramid has regular octagon $ABCDEFGH$ with side length $1$ as its base and apex $V.$ Segments $\overline{AV}$ and $\overline{DV}$ are perpendicular. What is the square of the height of the pyramid? $ \textbf{(A) }1 \qquad \textbf{(B) }\frac{1+\sqrt2}{2} \qquad \textbf{(C) }\sqrt2 \qquad \textbf{(D) }\frac32 \qquad \textbf{(E) }\frac{2+\sqrt2}{3} \qquad $

Let $S$ be a set of $n$ points in the plane such that no four points are collinear. Let $\{d_1,d_2,\cdots ,d_k\}$ be the set of distances between pairs of distinct points in $S$, and let $m_i$ be the multiplicity of $d_i$, i.e. the number of unordered pairs $\{P,Q\}\subseteq S$ with $|PQ|=d_i$. Prove that $\sum_{i=1}^k m_i^2\leq n^3-n^2$.

Jimmy runs a successful pizza shop. In the middle of a busy day, he realizes that he is running low on ingredients. Each pizza must have 1 lb of dough, $\frac14$ lb of cheese, $\frac16$ lb of sauce, and $\frac13$ lb of toppings, which include pepperonis, mushrooms, olives, and sausages. Given that Jimmy currently has 200 lbs of dough, 20 lbs of cheese, 20 lbs of sauce, 15 lbs of pepperonis, 5 lbs of mushrooms, 5 lbs of olives, and 10 lbs of sausages, what is the maximum number of pizzas that JImmy can make?

Let $a$, $b$, and $c$ be real numbers such that $abc=1$. prove that $\frac{1+a+ab}{1+b+ab}$ +$\frac{1+b+bc}{1+c+bc}$ + $\frac{1+c+ac}{1+a+ac}$ $>=3$

It is given that $n$ and $\sqrt{12n^2+1}$ are both positive integers. Prove that: $$ \sqrt{ \frac{\sqrt{12n^2+1}+1}{2}} $$ is also positive integer.

Determine the last three digits of $374^{2022}.$ [i]2022 CCA Math Bonanza Tiebreaker Round #2[/i]

Triangle $ABC$ has an inscribed circle tangent to sides $AB$, $AC$ and $BC$ at points $C_1$, $B_1$ and $A_1 $ respectively. Let $K$ be a point on the circle diametrically opposite to point $C_1$, $D$ be the intersection point of lines $B_1C_1$ and $A_1K$. Prove that $CD = CB_1$.