Prove that the product of four consecutive integers plus $1$ is a perfect square.

Let $z_1, z_2, ..., z_{2020}$ be the roots of the polynomial $z^{2020} + z^{2019} +...+ z + 1$. Compute $$\sum^{2020}_{i=1} \frac{1}{1 -z^{2020}_i}.$$

We are given a $\Delta ABC$. Point $D$ on the circumscribed circle k is such that $CD$ is a symmedian in $\Delta ABC$. Let $X$ and $Y$ be on the rays $\overrightarrow{CB}$ and $\overrightarrow{CA}$, so that $CX=2CA$ and $CY=2CB$. Prove that the circle, tangent externally to $k$ and to the lines $CA$ and $CB$, is tangent to the circumscribed circle of $\Delta XDY$.

Points $A$ and $B$ are $5$ units apart. How many lines in a given plane containing $A$ and $B$ are $2$ units from $A$ and $3$ units from $B$? $\textbf{(A) }0\qquad \textbf{(B) }1\qquad \textbf{(C) }2\qquad \textbf{(D) }3\qquad \textbf{(E) }\text{more than }3$

You have an unlimited supply of square tiles with side length $ 1$ and equilateral triangle tiles with side length $ 1$. For which n can you use these tiles to create a convex $n$-sided polygon? The tiles must fit together without gaps and may not overlap.

Let $r \geq 2023$ be a rational number. The real numbers $a, b$, and $c$ satisfy \[ 4a^2 + 4b^2 + 9c^2 = r. \] Does there exist a value of $r$ for which the number of rational triples $(a,b,c)$ that achieve the maximum possible value of $4ab + 6bc - 6ac$ is: a) zero b) finite, but non-zero?

Let $z$ be a complex number with $|z| = 2014$. Let $P$ be the polygon in the complex plane whose vertices are $z$ and every $w$ such that $\tfrac{1}{z+w} = \tfrac{1}{z} + \tfrac{1}{w}$. Then the area enclosed by $P$ can be written in the form $n\sqrt{3},$ where $n$ is an integer. Find the remainder when $n$ is divided by $1000$.

In every cell of a board $101 \times 101$ is written a positive integer. For any choice of $101$ cells from different rows and columns, their sum is divisible by $101$. Show that the number of ways to choose a cell from each row of the board, so that the total sum of the numbers in the chosen cells is divisible by $101$, is divisible by $101$.

Let $OABC$ be a trihedral angle such that \[ \angle BOC = \alpha, \quad \angle COA = \beta, \quad \angle AOB = \gamma , \quad \alpha + \beta + \gamma = \pi . \] For any interior point $P$ of the trihedral angle let $P_1$, $P_2$ and $P_3$ be the projections of $P$ on the three faces. Prove that $OP \geq PP_1+PP_2+PP_3$. [i]Constantin Cocea[/i]

If $M$ is $30 \%$ of $Q$, $Q$ is $20 \%$ of $P$, and $N$ is $50 \%$ of $P$, then $\frac{M}{N} =$ $\textbf{(A)}\ \frac{3}{250} \qquad \textbf{(B)}\ \frac{3}{25} \qquad \textbf{(C)}\ 1 \qquad \textbf{(D)}\ \displaystyle \frac{6}{5} \qquad \textbf{(E)}\ \displaystyle \frac{4}{3}$

A tortoise challenges a hare to a race. The hare eagerly agrees and quickly runs ahead, leaving the slow-moving tortoise behind. Confident that he will win, the hare stops to take a nap. Meanwhile, the tortoise walks at a slow steady pace for the entire race. The hare awakes and runs to the finish line, only to find the tortoise already there. Which of the following graphs matches the description of the race, showing the distance $d$ traveled by the two animals over time $t$ from start to finish?$\phantom{h}$ [asy] unitsize(0.4 cm); pair transx, transy; int i, j; int x, y; transx = (13,0); transy = (0,-9); for (i = 0; i <= 2; ++i) { for (j = 0; j <= 1; ++j) { if (i <= 1 || j <= 0) { for (x = 1; x <= 10; ++x) { draw(shift(i*transx + j*transy)*((x,0)--(x,5)),gray(0.7) + dashed); } for (y = 1; y <= 5; ++y) { draw(shift(i*transx + j*transy)*((0,y)--(10,y)),gray(0.7) + dashed); } draw(shift(i*transx + j*transy)*((0,0)--(11,0)),Arrow(6)); draw(shift(i*transx + j*transy)*((0,0)--(0,6)),Arrow(6)); label("time", (5,-0.5) + i*transx + j*transy); label(rotate(90)*"distance", (-0.5,2.5) + i*transx + j*transy); } }} draw((0,0)--(1.5,2.5)--(7.5,2.5)--(9,5),linewidth(1.5*bp)); draw((0,0)--(10,5),linewidth(1.5*bp)); draw(shift(transx)*((0,0)--(2.5,2.5)--(7.5,2.5)--(10,5)),linewidth(1.5*bp)); draw(shift(transx)*((0,0)--(9,5)),linewidth(1.5*bp)); draw(shift(2*transx)*((0,0)--(2.5,3)--(7,2)--(10,5)),linewidth(1.5*bp)); draw(shift(2*transx)*((0,0)--(9,5)),linewidth(1.5*bp)); draw(shift(transy)*((0,0)--(2.5,2.5)--(6.5,2.5)--(9,5)),linewidth(1.5*bp)); draw(shift(transy)*((0,0)--(7.5,2)--(10,5)),linewidth(1.5*bp)); draw(shift(transx + transy)*((0,0)--(2.5,2)--(7.5,3)--(10,5)),linewidth(1.5*bp)); draw(shift(transx + transy)*((0,0)--(9,5)),linewidth(1.5*bp)); label("(A)", (-1,6)); label("(B)", (-1,6) + transx); label("(C)", (-1,6) + 2*transx); label("(D)", (-1,6) + transy); label("(E)", (-1,6) + transx + transy); [/asy]

A positive integer $n$ is called [i]naughty[/i] if it can be written in the form $n=a^b+b$ with integers $a,b \geq 2$. Is there a sequence of $102$ consecutive positive integers such that exactly $100$ of those numbers are naughty?

Let $ABC$ be an acute triangle, with $\angle A > 60^\circ$, and let $H$ be it's orthocenter. Let $M$ and $N$ be points on $AB$ and $AC$, respectively, such that $\angle HMB = \angle HNC = 60^\circ$. Also, let $O$ be the circuncenter of $HMN$ and $D$ be a point on the semiplane determined by $BC$ that contains $A$ in such a way that $DBC$ is equilateral. Prove that $H$, $O$ and $D$ are collinear.

Does the sequence \[11, 111, 1111, 11111, \ldots\] contain any fifth power of a positive integer? Justify your answer.

In the group of ten persons, each person is asked to write the sum of the ages of all the other nine persons. Of all ten sums form the nine-element set $\{ 82, 83,84,85,87,89,90,91,92 \}$, find the individual ages of the persons, assuming them to be whole numbers.

$\mathbb{P}$ is a n-gon with sides $l_1 ,...,l_n$ and vertices on a circle. Prove that no n-gon with this sides has area more than $\mathbb{P}$