Two lines parallel to the $x$-axis cut the graph of $y=ax^3+bx^2+cx+d$ in points $A,C,E$ and $B,D,F$ respectively, in that order from left to right. Prove that the length of the projection of the segment $CD$ onto the $x$-axis equals the sum of the lengths of the projections of $AB$ and $EF$.

Find all positive real numbers $x, y, z$, such that $$x - \frac{1}{y^2} = y - \frac{1}{z^2}= z - \frac{1}{x^2}$$

Find all primes $p,q$ such that $p^3-q^7=p-q$.

Let $ABC$ be a triangle inscribed in the circle $(O)$. Tangents at $B,C$ of the circles $(O)$ meet at $T$ . Let $M,N$ be the points on the rays $BT,CT$ respectively such that $BM = BC = CN$. The line through $M$ and $N$ intersects $CA,AB$ at $E, F$ respectively; $BE$ meets $CT$ at $P, CF$ intersects $BT$ at $Q$. Prove that $AP = AQ$. Trần Quang Hùng

Let $ABC$ be a triangle with $\angle B > \angle C$. Let $P$ and $Q$ be two different points on line $AC$ such that $\angle PBA = \angle QBA = \angle ACB $ and $A$ is located between $P$ and $C$. Suppose that there exists an interior point $D$ of segment $BQ$ for which $PD=PB$. Let the ray $AD$ intersect the circle $ABC$ at $R \neq A$. Prove that $QB = QR$.

A magic $3 \times 5$ board can toggle its cells between black and white. Define a \textit{pattern} to be an assignment of black or white to each of the board's $15$ cells (so there are $2^{15}$ patterns total). Every day after Day 1, at the beginning of the day, the board gets bored with its black-white pattern and makes a new one. However, the board always wants to be unique and will die if any two of its patterns are less than $3$ cells different from each other. Furthermore, the board dies if it becomes all white. If the board begins with all cells black on Day $1$, compute the maximum number of days it can stay alive.

There are $n\ge3$ integers around a circle. We know that for each of these numbers the ratio between the sum of its two neighbors and the number is a positive integer. Prove that the sum of the $n$ ratios is not greater than $3n$.

For each positive integer $n$, decide whether it is possible to tile a square with exactly $n+1$ similar rectangles, each with a positive area and aspect ratio $1:n$.

Compute $\sin^4\left(7.5^\circ\right)+\sin^4\left(82.5^\circ\right)$. [i]2019 CCA Math Bonanza Lightning Round #2.3[/i]

An infinite squared sheet is given, with squares of side length $1$. The “distance” between two squares is defined as the length of the shortest path from one of these squares to the other if moving between them like a chess rook (measured along the trajectory of the centre of the rook). Determine the minimum number of colours with which it is possible to colour the sheet (each square being given a single colour) in such a way that each pair of squares with distance between them equal to $6$ units is given different colours. Give an example of such a colouring and prove that using a smaller number of colours we cannot achieve this goal. (AG Pechkovskiy, IV Itenberg)

In each square of a $4$ by $4$ grid, you put either a $+1$ or a $-1$. If any 2 rows and 2 columns are deleted, the sum of the remaining 4 numbers is nonnegative. What is the minimum number of $+1$'s needed to be placed to be able to satisfy the conditions

Find all integers n for which number $ \log_{2n\minus{}1}(n^2\plus{}2)$ is rational.

Find the condition of $a,b$ for which the function $f(x)\ (0\leq x\leq 2\pi)$ satisfying the following equality can be determined uniquely,then determine $f(x)$, assuming that $f(x) $ is a continuous function at $0\leq x\leq 2\pi$. \[f(x)=\frac{a}{2\pi}\int_0^{2\pi} \sin (x+y)f(y)dy+\frac{b}{2\pi}\int_0^{2\pi} \cos (x-y)f(y)dy+\sin x+\cos x\]

Spinners A and B are spun. On each spinner, the arrow is equally likely to land on each number. What is the probability that the product of the two spinners' numbers is even? [asy] defaultpen(linewidth(1)); draw(unitcircle); draw((1,0)--(-1,0)); draw((0,1)--(0,-1)); draw(shift(3,0)*unitcircle); draw(shift(3,0)*(origin--dir(90))); draw(shift(3,0)*(origin--dir(210))); draw(shift(3,0)*(origin--dir(330))); draw(0.7*dir(200)--0.7*dir(20), linewidth(0.7), EndArrow(7)); draw(shift(3,0)*(0.7*dir(180+65)--0.7*dir(65)), linewidth(0.7), EndArrow(7)); label("$1$", (-0.45,0.1), N); label("$4$", (-0.45,-0.1), S); label("$3$", (0.45,-0.1), S); label("$2$", (0.45,0.1), N); label("$1$", shift(3,0)*(-0.25,0.1), NW); label("$2$", shift(3,0)*(0.25,0.1), NE); label("$3$", shift(3,0)*(0,-0.3), S); label("$A$", (0,-1), S); label("$B$", (3,-1), S); [/asy] $ \textbf{(A)}\ \frac{1}{4}\qquad\textbf{(B)}\ \frac{1}{3}\qquad\textbf{(C)}\ \frac{1}{2}\qquad\textbf{(D)}\ \frac{2}{3}\qquad\textbf{(E)}\ \frac{3}{4} $

Let $a,b\ge 0$. Prove that $$\sqrt{2}\left(\sqrt{a(a+b)^3}+b\sqrt{a^2+b^2}\right)\le 3(a^2+b^2)$$ with equality if and only if $a=b$.

Suppose $n>2$ and let $A_1,\dots,A_n$ be points on the plane such that no three are collinear. [b](a)[/b] Suppose $M_1,\dots,M_n$ be points on segments $A_1A_2,A_2A_3,\dots ,A_nA_1$ respectively. Prove that if $B_1,\dots,B_n$ are points in triangles $M_2A_2M_1,M_3A_3M_2,\dots ,M_1A_1M_n$ respectively then \[|B_1B_2|+|B_2B_3|+\dots+|B_nB_1| \leq |A_1A_2|+|A_2A_3|+\dots+|A_nA_1|\] Where $|XY|$ means the length of line segment between $X$ and $Y$. [b](b)[/b] If $X$, $Y$ and $Z$ are three points on the plane then by $H_{XYZ}$ we mean the half-plane that it's boundary is the exterior angle bisector of angle $\hat{XYZ}$ and doesn't contain $X$ and $Z$ ,having $Y$ crossed out. Prove that if $C_1,\dots ,C_n$ are points in ${H_{A_nA_1A_2},H_{A_1A_2A_3},\dots,H_{A_{n-1}A_nA_1}}$ then \[|A_1A_2|+|A_2A_3|+\dots +|A_nA_1| \leq |C_1C_2|+|C_2C_3|+\dots+|C_nC_1|\] Time allowed for this problem was 2 hours.

In triangle $ABC$, we draw the circle with center $A$ and radius $AB$. This circle intersects $AC$ at two points. Also we draw the circle with center $A$ and radius $AC$ and this circle intersects $AB$ at two points. Denote these four points by $A_1, A_2, A_3, A_4$. Find the points $B_1, B_2, B_3, B_4$ and $C_1, C_2, C_3, C_4$ similarly. Suppose that these $12$ points lie on two circles. Prove that the triangle $ABC$ is isosceles.

Points $A$, $B$, $C$, and $D$ lie on a circle such that chords $\overline{AC}$ and $\overline{BD}$ intersect at a point $E$ inside the circle. Suppose that $\angle ADE =\angle CBE = 75^\circ$, $BE=4$, and $DE=8$. The value of $AB^2$ can be written in the form $a+b\sqrt{c}$ for positive integers $a$, $b$, and $c$ such that $c$ is not divisible by the square of any prime. Find $a+b+c$. [i]Proposed by Tony Kim[/i]

An isosceles trapezoid $ABCD$ ($AB = CD$) is given. A point $P$ on its circumcircle is such that segments $CP$ and $AD$ meet at point $Q$. Let $L$ be tha midpoint of$ QD$. Prove that the diagonal of the trapezoid is not greater than the sum of distances from the midpoints of the lateral sides to ana arbitrary point of line $PL$.

Let $A = (1, 0)$, $B = (0, 1)$, and $C = (0, 0)$. There are three distinct points, $P, Q, R$, such that $\{A, B, C, P\}$, $\{A, B, C, Q\}$, $\{A, B, C, R\}$ are all parallelograms (vertices unordered). Find the area of $\vartriangle PQR$.

a) Does there exist a function $f: N \to N$ such that $f(f(n))=f(n+1) - f(n)$ for all $n \in N$? b) Does there exist a function $f: N \to N$ such that $f(f(n))=f(n+2) - f(n)$ for all $n \in N$? I. Voronovich

In a cardboard box are a large number of loose socks. Some of the socks are red, the others are blue. It is stated that the total number of socks does not exceed $1993$. Furthermore, it is stated that the probability of pulling two socks from the same color when two socks are randomly drawn from the box is $1/2$. What is according to the available information, the largest number of red socks that can exist in the box?

How many ordered triples of integers $(a, b, c)$ satisfy the following system? $$ \begin{cases} ab + c &= 17 \\ a + bc &= 19 \end{cases} $$ $$ \mathrm a. ~ 2\qquad \mathrm b.~3\qquad \mathrm c. ~4 \qquad \mathrm d. ~5 \qquad \mathrm e. ~6 $$

Find all functions $f:(0,\infty) \rightarrow (0,\infty)$ such that \[f\left(x+\frac{1}{y}\right)+f\left(y+\frac{1}{z}\right) + f\left(z+\frac{1}{x}\right) = 1\] for all $x,y,z >0$ with $xyz =1$.

A straight line connects City A at $(0, 0)$ to City B, 300 meters away at $(300, 0)$. At time $t=0$, a bullet train instantaneously sets out from City A to City B while another bullet train simultaneously leaves from City B to City A going on the same train track. Both trains are traveling at a constant speed of $50$ meters/second. Also, at $t=0$, a super y stationed at $(150, 0)$ and restricted to move only on the train tracks travels towards City B. The y always travels at 60 meters/second, and any time it hits a train, it instantaneously reverses its direction and travels at the same speed. At the moment the trains collide, what is the total distance that the y will have traveled? Assume each train is a point and that the trains travel at their same respective velocities before and after collisions with the y