What is the area of the shaded figure shown below? [asy] size(200); defaultpen(linewidth(0.4)+fontsize(12)); pen s = linewidth(0.8)+fontsize(8); pair O,X,Y; O = origin; X = (6,0); Y = (0,5); fill((1,0)--(3,5)--(5,0)--(3,2)--cycle, palegray+opacity(0.2)); for (int i=1; i<7; ++i) { draw((i,0)--(i,5), gray+dashed); label("${"+string(i)+"}$", (i,0), 2*S); if (i<6) { draw((0,i)--(6,i), gray+dashed); label("${"+string(i)+"}$", (0,i), 2*W); } } label("$0$", O, 2*SW); draw(O--X+(0.15,0), EndArrow); draw(O--Y+(0,0.15), EndArrow); draw((1,0)--(3,5)--(5,0)--(3,2)--(1,0), black+1.5); [/asy]

The side lengths of an equiangular octagon alternate between $20$ and $22$. Find its area.

Decide whether for every polynomial $P$ of degree at least $1$, there exist infinitely many primes that divide $P(n)$ for at least one positive integer $n$. [i](Walther Janous)[/i]

Prove that $ \lfloor{(4+\sqrt11)^{n}}\rfloor $ is odd for every natural number n.

Let $O$ be the circumcenter of an acute-angled triangle $ABC$ with ${\angle B<\angle C}$. The line $AO$ meets the side $BC$ at $D$. The circumcenters of the triangles $ABD$ and $ACD$ are $E$ and $F$, respectively. Extend the sides $BA$ and $CA$ beyond $A$, and choose on the respective extensions points $G$ and $H$ such that ${AG=AC}$ and ${AH=AB}$. Prove that the quadrilateral $EFGH$ is a rectangle if and only if ${\angle ACB-\angle ABC=60^{\circ }}$. [i]Proposed by Hojoo Lee, Korea[/i]

What is the least possible number of the checkers being required a) for the $8\times 8$ chess-board, b) for the $n\times n$ chess-board, to provide the property: [i]Every line (of the chess-board fields) parallel to the side or diagonal is occupied by at least one checker[/i] ?

MTRPia in $2044$ is highly advanced and a lot of the work is done by disc-shaped robots, each of radius $1$ unit. In order to not collide with each other, there robots have a smaller $360$-degree camera mounted on top, as shown in the figure (robot $r_1$ 'sees' robot $r_2$). Each of there cameras themselves are smaller discs of radius $c$. Suppose there are three robots $r_1, r_2, r_3$ placed 'consecutively' such that $r_2$ is roughly in the middle. The angle between the lines joining the centres of $r_1, r_2$ and $r_2, r_3$ is given to be $\theta$. The distance between the centres of $r_1,r_2 = $ distance between centres of $r_2,r_3 = d$. Show (with the aid of clear diagrams) that $r_1$ and $r_3$ can see each other iff $\sin{\theta} > \frac{1-c}{d}$. As a bonus, try to show that in a longer 'chain' of such robots (same $d$, $\theta$), if $\sin{\theta} > \frac{1-c}{d}$ then all robots can see each other.

The triangle $ABC$ with $AB> AC$ is inscribed in a circle, the angle bisector of $\angle BAC$ intersects the side $BC$ of the triangle at the point $K$, and the circumscribed circle at the point $M$. The midline of $\Delta ABC$, which is parallel to the side $AB$, intersects $AM$ at the point $O$, the line $CO$ intersects the line $AB$ at the point $N$. Prove that a circle can be circumscribed around the quadrilateral $BNKM$. (Nagel Igor)

Prove that the numbers from $1$ to $16$ can be written in a line, but cannot be written in a circle so that the sum of any two adjacent numbers is square of a natural number.

For real numbers $x$ and $y$, let $M$ be the maximum value of the expression $x^4y + x^3y + x^2y + xy + xy^2 + xy^3 + xy^4$, subject to $x + y = 3$. Find $[M]$.

The function $f(x) = x^2 + (2a + 3)x + (a^2 + 1)$ only has real zeroes. Suppose the smallest possible value of $a$ can be written in the form $p/q$, where $p, q$ are relatively prime integers. Find $|p| + |q|$.

Determine all pairs of integers $(a, b)$ such that \[\frac{a^{2}}{2ab^{2}-b^{3}+1}\] is a positive integer.

Let $A$ be an infinite set of points in the plane such that inside each circle there are only a finite number of points of $A$, with the following properties: $\bullet$ $(0, 0)$ belongs to $A$. $\bullet$ If $(a, b)$ and $(c, d)$ belong to $A$, then $(a-c, b-d)$ belongs to $A$. $\bullet$ There is a value of $\alpha$ such that by rotating the set $A$ with center at $(0, 0)$ and angle $\alpha$, the set $A$ is obtained again. Prove that $\alpha$ must be equal to $\pm 60^{\circ}$ or $\pm 90^{\circ}$ or $\pm 120^{\circ}$ or $\pm 180^{\circ}$.

Let $\Gamma$ be the circumcircle of triangle $ABC$. One circle $\omega$is tangent to $\Gamma$ at $A$ and tangent to $BC$ at $N$. Suppose that the extension of $AN$ crosses $\Gamma$ again at $E$. Let $AD$ and $AF$ be respectively the line of altitude $ABC$ and diameter of $\Gamma$, show that $AN \times AE = AD \times AF = AB \times AC$

Willy Wonka has $n$ distinguishable pieces of candy that he wants to split into groups. If the number of ways for him to do this is $p(n)$, then we have \begin{tabular}{|c|c|c|c|c|c|c|c|c|c|c|}\hline $n$ & $1$ & $2$ & $3$ & $4$ & $5$ & $6$ & $7$ & $8$ & $9$ & $10$ \\\hline $p(n)$ & $1$ & $2$ & $5$ & $15$ & $52$ & $203$ & $877$ & $4140$ & $21147$ & $115975$ \\\hline \end{tabular} Define a [i]splitting[/i] of the $n$ distinguishable pieces of candy to be a way of splitting them into groups. If Willy Wonka has $8$ candies, what is the sum of the number of groups over all splittings he can use? [i]2020 CCA Math Bonanza Lightning Round #3.4[/i]

Let be a finite field $ K. $ Say that two polynoms $ f,g $ from $ K[X] $ are [i]neighbours,[/i] if the have the same degree and they differ by exactly one coefficient. [b]a)[/b] Show that all the neighbours of $ 1+X^2 $ from $ \mathbb{Z}_3[X] $ are reducible in $ \mathbb{Z}_3[X] . $ [b]b)[/b] If $ |K|\ge 4, $ show that any polynomial of degree $ |K|-1 $ from $ K[X] $ has a neighbour from $ K[X] $ that is reducible in $ K[X] , $ and also has a neighbour that doesn´t have any root in $ K. $