Let $A$ and $B$ be points on a circle $k$. Suppose that an arc $k'$ of another circle, $\ell$, connects $A$ with $B$ and divides the area inside the circle $k$ into two equal parts. Prove that arc $k'$ is longer than the diameter of $k$.

Define the operation $ \star$ by $ a\star b \equal{} (a \plus{} b)b$. What is $ (3\star 5) \minus{} (5\star 3)$? $ \textbf{(A)}\ \minus{}16\qquad \textbf{(B)}\ \minus{}8\qquad \textbf{(C)}\ 0\qquad \textbf{(D)}\ 8\qquad \textbf{(E)}\ 16$

The median $ AM $ of $ ABC $ meets the incircle of $ ABC $ at $ K,L. $ The lines thru $ K $ and $ L, $ both parallel to $ BC $ meets the incircle of $ ABC $ at $ XY. $ The intersections of $ AX $ and $ AY $ with $ BC $ are $ P,Q, $ respectively. Prove that $ BP=CQ. $

Let \( \triangle ABC \) be a triangle such that \( BC > AC > AB \). A point \( X \) is marked on side \( BC \) such that \( AX = XC \). Let \( Y \) be a point on segment \( AX \) such that \( CY = AB \). Prove that \( \angle CYX = \angle ABC \).

An alphabet consists of $n$ letters. What is the maximal length of a word if we know that any two consecutive letters $a,b$ of the word are different and that the word cannot be reduced to a word of the kind $abab$ with $a\neq b$ by removing letters.

A sequence $(a_k)_{k=1}^{\infty}$ has the property that there is a natural number $n$ such that $a_1 + a_2 +...+ a_n = 0$ and $a_{n+k} = a_k$ for all $k$. Prove that there exists a natural number $N$ such that $$\sum_{i=N}^{N+k} a_i \ge 0 \,\, \,\, for \,\,\,\, k = 0,1,2...$$

There is a board with 32 rows and 10 columns. Pablo writes 1 or -1 in each box. Matías, with Pablo's board in view, chooses one or more columns, and in each of the chosen columns, changes all of Pablo's numbers to their opposites (where there is 1 he puts -1 and where there is -1 he puts 1) . In the other columns, leave Pablo's numbers. Matías wins if he manages to make his board have each of the rows different from all the rows on Pablo's board. Otherwise, that is, if any row on Matías's board is equal to any row on Pablo's board, Pablo wins. If both play perfectly, determine which of the two is assured of victory.

A part of a forest park which is located between two roads has caught fire. The fire is spreading at a speed of $10$ kilometers per hour. If the distance between the starting point of the fire and both roads is $10$ kilometers, what is the area of the burned region after two hours in kilometers squared? (Assume that the roads are long, straight parallel lines and the fire does not enter the roads) $\textbf{(A)}\ 200\sqrt 3\qquad\textbf{(B)}\ 100 \sqrt 3\qquad\textbf{(C)}\ 400\sqrt 3 + 400 \frac{\pi}{3} \qquad\textbf{(D)}\ 200\sqrt 3 + 400 \frac{\pi}{3} \qquad\textbf{(E)}\ 400\sqrt 3 $

Prove that if the numbers $a, b, c, d$ satisfy the system of equations $$\begin{cases} a^2+b^2=2cd \\ b^2+c^2=2da \\ c^2+d^2=2ab \end{cases}$$ then $a=b=c=d$.

Let $x$ and $y$ be rational numbers, such that $x^{5}+y^{5}=2x^{2}y^{2}$. Prove that $1-xy$ is the square of a rational number.

In $\triangle ABC$ with $AB=AC$, point $D$ lies strictly between $A$ and $C$ on side $\overline{AC}$, and point $E$ lies strictly between $A$ and $B$ on side $\overline{AB}$ such that $AE=ED=DB=BC$. The degree measure of $\angle ABC$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $G$ be the set of polynomials of the form \[P(z)=z^n+c_{n-1}z^{n-1}+\cdots+c_2z^2+c_1z+50,\] where $c_1,c_2,\cdots, c_{n-1}$ are integers and $P(z)$ has $n$ distinct roots of the form $a+ib$ with $a$ and $b$ integers. How many polynomials are in $G$? ${ \textbf{(A)}\ 288\qquad\textbf{(B)}\ 528\qquad\textbf{(C)}\ 576\qquad\textbf{(D}}\ 992\qquad\textbf{(E)}\ 1056 $

Find all functions $f(x) = ax^2 + bx + c$, with $a \ne 0$, such that $f(f(1)) = f(f(0)) = f(f(-1))$ .

Determine the greatest positive integer $ n$ such that in three-dimensional space, there exist n points $ P_{1},P_{2},\cdots,P_{n},$ among $ n$ points no three points are collinear, and for arbitary $ 1\leq i < j < k\leq n$, $ P_{i}P_{j}P_{k}$ isn't obtuse triangle.

Find four positive integers, each not exceeding $70000$ and each having more than $100$ divisors.

p1. The parabola $y = ax^2 + bx$, $a < 0$, has a vertex $C$ and intersects the $x$-axis at different points $A$ and $B$. The line $y = ax$ intersects the parabola at different points $A$ and $D$. If the area of triangle $ABC$ is equal to $|ab|$ times the area of ​​triangle $ABD$, find the value of $ b$ in terms of $a$ without use the absolute value sign. p2. It is known that $a$ is a prime number and $k$ is a positive integer. If $\sqrt{k^2-ak}$ is a positive integer, find the value of $k$ in terms of $a$. p3. There are five distinct points, $T_1$, $T_2$, $T_3$, $T_4$, and $T$ on a circle $\Omega$. Let $t_{ij}$ be the distance from the point $T$ to the line $T_iT_j$ or its extension. Prove that $\frac{t_{ij}}{t_{jk}}=\frac{TT_i}{TT_k}$ and $\frac{t_{12}}{t_{24}}=\frac{t_{13}}{t_{34}}$ [img]https://cdn.artofproblemsolving.com/attachments/2/8/07fff0a36a80708d6f6ec6708f609d080b44a2.png[/img] p4. Given a $7$-digit positive integer sequence $a_1, a_2, a_3, ..., a_{2017}$ with $a_1 < a_2 < a_3 < ...<a_{2017}$. Each of these terms has constituent numbers in non-increasing order. Is known that $a_1 = 1000000$ and $a_{n+1}$ is the smallest possible number that is greater than $a_n$. As For example, we get $a_2 = 1100000$ and $a_3 = 1110000$. Determine $a_{2017}$. p5. At the oil refinery in the Duri area, pump-1 and pump-2 are available. Both pumps are used to fill the holding tank with volume $V$. The tank can be fully filled using pump-1 alone within four hours, or using pump-2 only in six hours. Initially both pumps are used simultaneously for $a$ hours. Then, charging continues using only pump-1 for $ b$ hours and continues again using only pump-2 for $c$ hours. If the operating cost of pump-1 is $15(a + b)$ thousand per hour and pump-2 operating cost is $4(a + c)$ thousand per hour, determine $ b$ and $c$ so that the operating costs of all pumps are minimum (express $b$ and $c$ in terms of $a$). Also determine the possible values ​​of $a$.

Sofia and Viktor are playing the following game on a $2022 \times 2022$ board: - Firstly, Sofia covers the table completely by dominoes, no two are overlapping and all are inside the table; - Then Viktor without seeing the table, chooses a positive integer $n$; - After that Viktor looks at the table covered with dominoes, chooses and fixes $n$ of them; - Finally, Sofia removes the remaining dominoes that aren't fixed and tries to recover the table with dominoes differently from before. If she achieves that, she wins, otherwise Viktor wins. What is the minimum number $n$ for which Viktor can always win, no matter the starting covering of dominoes. [i]Proposed by Viktor Simjanoski[/i]

Points $D,E$ and $F$ are taken on the sides $BC,CA,AB$ of a triangle $ABC$ respectively so that the segments $AD, BE$ and $CF$ intersect at point $O$. Prove that $\frac{AO}{OD}= \frac{AE}{EC}+\frac{AF}{FB}$ .

Determine the values of the positive integer $n$ for which the following system of equations has a solution in positive integers $x_1, x_2,...,, x_n$. Find all solutions for each such $n$. $$\begin{cases} x_1 + x_2 +...+ x_n = 16 \\ \\ \dfrac{1}{x_1} + \dfrac{1}{x_2} +...+ \dfrac{1}{x_n} = 1\end{cases}$$

Solve the equation $xy =1997(x + y)$ in integers.

Several strips and a circle of radius $1$ are drawn on the plane. The sum of the widths of the strips is $100$. Prove that one can translate each strip parallel to itself so that together they cover the circle. (M Smurov )

A ball is dropped from a height of $3$ meters. On its first bounce it rises to a height of $2$ meters. It keeps falling and bouncing to $\frac{2}{3}$ of the height it reached in the previous bounce. On which bounce will it not rise to a height of $0.5$ meters? $\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 7$

Let $f(x)$ be a function such that $f(1) = 1234$, $f(2)=1800$, and $f(x) = f(x-1) + 2f(x-2)-1$ for all integers $x$. Evaluate the number of divisors of \[\sum_{i=1}^{2022}f(i)\] [i]2022 CCA Math Bonanza Tiebreaker Round #4[/i]

A subset $S$ of $ {1,2,...,n}$ is called balanced if for every $a $ from $S $ there exists some $ b $from $S$, $b\neq a$, such that $ \frac{(a+b)}{2}$ is in $S$ as well. (a) Let $k > 1 $be an integer and let $n = 2k$. Show that every subset $ S$ of ${1,2,...,n} $ with $|S| > \frac{3n}{4}$ is balanced. (b) Does there exist an $n =2k$, with $ k > 1 $ an integer, for which every subset $ S$ of ${1,2,...,n} $ with $ |S| >\frac{2n}{3} $ is balanced?

In a scalene triangle $\Delta ABC$, $AB<AC$, $PB$ and $PC$ are tangents of the circumcircle $(O)$ of $\Delta ABC$. A point $R$ lies on the arc $\widehat{AC}$(not containing $B$), $PR$ intersects $(O)$ again at $Q$. Suppose $I$ is the incenter of $\Delta ABC$, $ID \perp BC$ at $D$, $QD$ intersects $(O)$ again at $G$. A line passing through $I$ and perpendicular to $AI$ intersects $AG,AC$ at $M,N$, respectively. $S$ is the midpoint of arc $\widehat{AR}$, and$SN$ intersects $(O)$ again at $T$. Prove that, if $AR \parallel BC$, then $M,B,T$ are collinear.