On the sides of $\triangle{ABC}$ points $P,Q \in{AB}$ ($P$ is between $A$ and $Q$) and $R\in{BC}$ are chosen. The points $M$ and $N$ are defined as the intersection point of $AR$ with the segments $CP$ and $CQ$, respectively. If $BC=BQ$, $CP=AP$, $CR=CN$ and $\angle{BPC}=\angle{CRA}$, prove that $MP+NQ=BR$.

Compute \[ (2+0\cdot 2 \cdot 1)+(2+0-2) \cdot (1) + (2+0)\cdot (2-1) + (2) \cdot \left(0+2^{-1}\right). \] [i]2021 CCA Math Bonanza Lightning Round #1.1[/i]

On circle are $ 2008$ blue and $ 1$ red point(s) given. Are there more polygons which have a red point or those which dont have it??

Prove that there exists a convex 1990-gon with the following two properties : [b]a.)[/b] All angles are equal. [b]b.)[/b] The lengths of the 1990 sides are the numbers $ 1^2$, $ 2^2$, $ 3^2$, $ \cdots$, $ 1990^2$ in some order.

In the interior of a square $ABCD$ we construct the equilateral triangles $ABK, BCL, CDM, DAN.$ Prove that the midpoints of the four segments $KL, LM, MN, NK$ and the midpoints of the eight segments $AK, BK, BL, CL, CM, DM, DN, AN$ are the 12 vertices of a regular dodecagon.

Find all $x, y, z \in N_0$ with $(2^x + 1) (2^y-1) = 2^z-1$.

Aidan and Andrew independently select distinct cells in a $4 $ by $4$ grid, as well as a direction (either up, down, left, or right), both at random. Every second, each of them will travel $1$ cell in their chosen direction. Find the probability that Aidan and Andrew willmeet (be in the same cell at the same time) before either one of them hits an edge of the grid. (If Aidan and Andrew cross paths by switching cells, it doesn’t count as meeting.)

Let $A,B,C$ be variable points on edges $OX,OY,OZ$ of a trihedral angle $OXYZ$, respectively. Let $OA = a, OB = b, OC = c$ and $R$ be the radius of the circumsphere $S$ of $OABC$. Prove that if points $A,B,C$ vary so that $a+b+c = R+l$, then the sphere $S$ remains tangent to a fixed sphere.

The $100 \times 100$ table is filled with numbers from $1$ to $10 \ 000$ as shown in the figure. Is it possible to rearrange some numbers so that there is still one number in each cell, and so that the sum of the numbers does not change in all rectangles of three cells?

Triangle $ABC$ with $AB = 10$ cm ¸and $\angle C= 15^o$, is right at $B$. Point $D \in (AC)$ is the foot of the altitude taken from $B$. Find the distance from point $D$ to the line $AB$.

Show that we can find $\alpha>0$ such that, given any point $P$ inside a regular $2n+1$-gon which is inscribed in a circle radius $1$, we can find two vertices of the polygon whose distance from $P$ differ by less than $\frac1n-\frac\alpha{n^3}$.

Here is a list of the numbers of fish that Tyler caught in nine outings last summer: \[2,0,1,3,0,3,3,1,2.\] Which statement about the mean, median, and mode is true? $\textbf{(A)} \text{median} < \text{mean} < \text{mode} \qquad \textbf{(B)} \text{mean} < \text{mode} < \text{median} \\ \\ \textbf{(C)} \text{mean} < \text{median} < \text{mode} \qquad \textbf{(D)} \text{median} < \text{mode} < \text{mean} \\ \\ \textbf{(E)} \text{mode} < \text{median} < \text{mean}$

Let $p(x)$ be a polynomial with real coefficients and $n$ be a positive integer. Prove that there exists a non-zero polynomial $q(x)$ with real coefficients such that the polynomial $p(x)\cdot q(x)$ has non-zero coefficients only by the powers which are multiples of $n$.

The cells of a $(n^2-n+1)\times(n^2-n+1)$ matrix are coloured using $n$ colours. A colour is called [i]dominant[/i] on a row (or a column) if there are at least $n$ cells of this colour on that row (or column). A cell is called [i]extremal[/i] if its colour is [i]dominant [/i] both on its row, and its column. Find all $n \ge 2$ for which there is a colouring with no [i]extremal [/i] cells. Iurie Boreico (Moldova)

An integer $n$ is chosen uniformly at random from the set $\{1, 2, \ldots, 2023!\}.$ Compute the probability that $$\gcd(n^n+50, n+1)=1.$$

Let $p>2$ be a prime number, and $(a_k)_{k\geqslant 1}$ be a sequence defined by $a_1=p$ and $a_{k+1}=2a_k+1$, $k\geqslant 1$. Show that one of the first $p$ terms of the sequence is not prime. [i]Marcel Țena[/i]

Let $S = \{2,5,8,11,14,17,20,\dots\}$. Given that one can choose $n$ different numbers from $S$, $\{A_1,A_2,\dots,A_n\}$ s.t. $\sum_{i=1}^n \frac{1}{A_i} = 1$, find the minimum possible value of $n$.

Find all polynomials $f(x)$ with real coefficients for which \[f(x)f(2x^2) = f(2x^3 + x).\]

A bug walks all day and sleeps all night. On the first day, it starts at point $O$, faces east, and walks a distance of 5 units due east. Each night the bug rotates $60 ^\circ$ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to point $P$. Then $OP^2 = \frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let $ 0 $ be a root for a polynom $ f\in\mathbb{R}[X] $ that has the property that $ f(X^2-X+1) =f^2(X)-f(X)+1. $ Determine this polynom. [i]Nelu Chichirim[/i]

Let $ABCD$ be a cyclic quadrilateral with $\angle ADC = \angle DBA$. Furthermore, let $E$ be the projection of $A$ on $BD$. Show that $BC = DE - BE$ .

Let $\vartriangle ABC$ be a triangle such that $\angle ABC = 30^o$, $\angle ACB = 15^o$. Let $M$ be midpoint of segment $BC$ and point $N$ lies on segment $MC$, such that the length of $NC$ is equal to length of $AB$. Proce that $AN$ is the bisector of the angle $\angle MAC$. [img]https://cdn.artofproblemsolving.com/attachments/2/7/4c554b53f03288ee69931fdd2c6fbd3e27ab13.png[/img]

We delete the four corners of a $8 \times 8$ chessboard. How many ways are there to place eight non-attacking rooks on the remaining squares? [i]Proposed by Evan Chen[/i]

In a rectangle $ABCD, E$ is the midpoint of $AB, F$ is a point on $AC$ such that $BF$ is perpendicular to $AC$, and $FE$ perpendicular to $BD$. Suppose $BC = 8\sqrt3$. Find $AB$.

A diabolical combination lock has $n$ dials (each with $c$ possible states), where $n,c>1$. The dials are initially set to states $d_1, d_2, \ldots, d_n$, where $0\le d_i\le c-1$ for each $1\le i\le n$. Unfortunately, the actual states of the dials (the $d_i$'s) are concealed, and the initial settings of the dials are also unknown. On a given turn, one may advance each dial by an integer amount $c_i$ ($0\le c_i\le c-1$), so that every dial is now in a state $d_i '\equiv d_i+c_i \pmod{c}$ with $0\le d_i ' \le c-1$. After each turn, the lock opens if and only if all of the dials are set to the zero state; otherwise, the lock selects a random integer $k$ and cyclically shifts the $d_i$'s by $k$ (so that for every $i$, $d_i$ is replaced by $d_{i-k}$, where indices are taken modulo $n$). Show that the lock can always be opened, regardless of the choices of the initial configuration and the choices of $k$ (which may vary from turn to turn), if and only if $n$ and $c$ are powers of the same prime. [i]Bobby Shen.[/i]