You are initially given the number $n=1$. Each turn, you may choose any positive divisor $d\mid n$, and multiply $n$ by $d+1$. For instance, on the first turn, you must select $d=1$, giving $n=1\cdot(1+1)=2$ as your new value of $n$. On the next turn, you can select either $d=1$ or $2$, giving $n=2\cdot(1+1)=4$ or $n=2\cdot(2+1)=6$, respectively, and so on. Find an algorithm that, in at most $k$ steps, results in $n$ being divisible by the number $2021^{2021^{2021}} - 1$. An algorithm that completes in at most $k$ steps will be awarded: 1 pt for $k>2021^{2021^{2021}}$ 20 pts for $k=2021^{2021^{2021}}$ 50 pts for $k=10^{10^4}$ 75 pts for $k=10^{10}$ 90 pts for $k=10^5$ 95 pts for $k=6\cdot10^4$ 100 pts for $k=5\cdot10^4$

Let a geometric progression with $n$ terms have first term one, common ratio $r$ and sum $s$, where $r$ and $s$ are not zero. The sum of the geometric progression formed by replacing each term of the original progression by its reciprocal is $\textbf{(A) }\frac{1}{s}\qquad\textbf{(B) }\frac{1}{r^ns}\qquad\textbf{(C) }\frac{s}{r^{n-1}}\qquad\textbf{(D) }\frac{r^n}{s}\qquad \textbf{(E) }\frac{r^{n-1}}{s}$

Three equilateral triangles $ABC, CDE, EHK$ (the vertices are mentioned counterclockwise) are lying in the plane so, that the vectors $\overrightarrow{AD}$ and $\overrightarrow{DK}$ are equal. Prove that the triangle $BHD$ is also equilateral

Let $ABCD$ be a convex quadrilateral, and let $P$, $Q$, $R$, and $S$ be points on the sides $AB$, $BC$, $CD$, and $DA$, respectively. Let the line segment $PR$ and $QS$ meet at $O$. Suppose that each of the quadrilaterals $APOS$, $BQOP$, $CROQ$, and $DSOR$ has an incircle. Prove that the lines $AC$, $PQ$, and $RS$ are either concurrent or parallel to each other.

How many pairs of positive integers $ (a,b)$ are there such that $ \gcd(a,b) \equal{} 1$ and \[ \frac {a}{b} \plus{} \frac {14b}{9a} \]is an integer? $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ \text{infinitely many}$

Let $f(x) =x^4+14x^3+52x^2+56x+16.$ Let $z_1, z_2, z_3, z_4$ be the four roots of $f$. Find the smallest possible value of $|z_az_b+z_cz_d|$ where $\{a,b,c,d\}=\{1,2,3,4\}$.

Consider cubes of edge length 5 composed of 125 cubes of edge length 1 where each of the 125 cubes is either coloured black or white. A cube of edge length 5 is called "big", a cube od edge length is called "small". A posititve integer $ n$ is called "representable" if there is a big cube with exactly $ n$ small cubes where each row of five small cubes has an even number of black cubes whose centres lie on a line with distances $ 1,2,3,4$ (zero counts as even number). (a) What is the smallest and biggest representable number? (b) Construct 45 representable numbers.

Let $ a,b,c $ be pairwise coprime positive integers. Find all positive integer values of $$ \frac{a+b}{c}+\frac{b+c}{a}+\frac{c+a}{b} $$

Consider a right-angled triangle $ABC$ with $\angle C = 90^o$. Suppose that the hypotenuse $AB$ is divided into four equal parts by the points $D,E,F$, such that $AD = DE = EF = FB$. If $CD^2 +CE^2 +CF^2 = 350$, find the length of $AB$.

Two equally oriented regular $2n$-gons $A_1A_2\ldots A_{2n}$ and $B_1B_2\ldots B_{2n}$ are given. The perpendicular bisectors $\ell_i$ of the segments $A_iB_i$ are drawn. Let the lines $\ell_i$ and $\ell_{i+1}$ intersect at the point $K_i$ (hereafter we reduce indices modulo $2n$). Denote by $m_i$ the line $K_iK_{i+n}$. Prove that $n{}$ lines $m_i$ intersect at one point and at that the angles between the lines $m_i$ and $m_{i+1}$ are equal. [i]Proposed by Chan Quang Hung (Vietnam)[/i]

A Pokemon fan walks into a store. An employee tells them that there are $2$ Pikachus, $3$ Eevees, $4$ Snorlaxes, and $5$ Bulbasaurs remaining inside the gacha machine. Given that this fan cannot see what is inside the Poké Balls before opening them, find the least number of Poké Balls they must buy in order to be sure to get one Pikachu and one Snorlax.

Let $m> 3$ be an integer. At a camp there are more than $m$ participants. The camp manager discovers that every time he picks out the camp participants, they say they have exactly one mutual friend among the participants. Which is the largest possible number of participants at the camp? (If $A$ is a friend of $B, B$ is also a friend of $A$. A person is not considered a friend of himself.)

Prove that there exist infinitely many integers \(n\) which satisfy \(2017^2 | 1^n + 2^n + ... + 2017^n\).

A baker uses $6\tfrac{2}{3}$ cups of flour when she prepares $\tfrac{5}{3}$ recipes of rolls. She will use $9\tfrac{3}{4}$ cups of flour when she prepares $\tfrac{m}{n}$ recipes of rolls where m and n are relatively prime positive integers. Find $m + n.$

Santiago, Daniel and Fátima practice for the Math Olympics. Santiago thinks of a regular polygon and Daniel of another, without telling Fatima what the polygons are. They just tell you that one of the polygons has $3$ more sides than the other and that an angle of one of the polygons measures $10$ degrees more than one angle of the other. From this, and knowing that each interior angle of a regular polygon of $n$ sides measures $\frac{180(n-2)}{n}$ degrees, Fatima identifies what the polygons are. How many sides do the polygons that James and Daniel chose, have?

Henry rolls a fair die. If the die shows the number $k$, Henry will then roll the die $k$ more times. The probability that Henry will never roll a 3 or a 6 either on his first roll or on one of the $k$ subsequent rolls is given by $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Find all positive integers n such that : $-2^{0}+2^{1}-2^{2}+2^{3}-2^{4}+...-(-2)^{n}=4^{0}+4^{1}+4^{2}+...+4^{2010}$

A circle is circumscribed around the triangle $ABC$. Chords, from the midpoint of the arc $AC$ to the midpoints of the arcs $AB$ and $BC$, intersect sides $[AB]$ and $[BC]$ in the points $D$ and $E$. Prove that $(DE)$ is parallel to $(AC)$ and passes through the centre of the inscribed circle.

In square $ABCD$, points $E$ and $H$ lie on $\overline{AB}$ and $\overline{DA}$, respectively, so that $AE=AH.$ Points $F$ and $G$ lie on $\overline{BC}$ and $\overline{CD}$, respectively, and points $I$ and $J$ lie on $\overline{EH}$ so that $\overline{FI} \perp \overline{EH}$ and $\overline{GJ} \perp \overline{EH}$. See the figure below. Triangle $AEH$, quadrilateral $BFIE$, quadrilateral $DHJG$, and pentagon $FCGJI$ each has area $1.$ What is $FI^2$? [asy] real x=2sqrt(2); real y=2sqrt(16-8sqrt(2))-4+2sqrt(2); real z=2sqrt(8-4sqrt(2)); pair A, B, C, D, E, F, G, H, I, J; A = (0,0); B = (4,0); C = (4,4); D = (0,4); E = (x,0); F = (4,y); G = (y,4); H = (0,x); I = F + z * dir(225); J = G + z * dir(225); draw(A--B--C--D--A); draw(H--E); draw(J--G^^F--I); draw(rightanglemark(G, J, I), linewidth(.5)); draw(rightanglemark(F, I, E), linewidth(.5)); dot("$A$", A, S); dot("$B$", B, S); dot("$C$", C, dir(90)); dot("$D$", D, dir(90)); dot("$E$", E, S); dot("$F$", F, dir(0)); dot("$G$", G, N); dot("$H$", H, W); dot("$I$", I, SW); dot("$J$", J, SW); [/asy] $\textbf{(A) } \frac{7}{3} \qquad \textbf{(B) } 8-4\sqrt2 \qquad \textbf{(C) } 1+\sqrt2 \qquad \textbf{(D) } \frac{7}{4}\sqrt2 \qquad \textbf{(E) } 2\sqrt2$

When 0.000315 is multiplied by 7,928,564 the product is closest to which of the following? $\textbf{(A) }210\qquad\textbf{(B) }240\qquad\textbf{(C) }2100\qquad\textbf{(D) }2400\qquad\textbf{(E) }24000$

Find all triples $(x, y, z)$ of integers such that \[\frac{1}{x^2}+\frac{2}{y^2}+\frac{3}{z^2} =\frac 23\]

A square of side length $5$ is inscribed in a square of side length $7$. If we construct a grid of $1\times1$ squares for both squares, as shown to the right, then we find that the two grids have $8$ lattice points in common. If we do the same construction by inscribing a square of side length $1489$ in a square of side length $2009$, and construct a grid of $1\times1$ squares in each large square, then how many lattice points will the two grids of $1\times1$ squares have in common? [asy] import graph; size(6cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-4.3,xmax=11.88,ymin=-4.69,ymax=8.77; pair H_2=(0,3), I_2=(3,7), J_2=(7,4), K_2=(4,0), L_2=(3.01,1.99), M_2=(2.01,4), N_2=(4.01,5.01), O_2=(5.01,3); draw((0,0)--(0,7)); draw((0,7)--(7,7)); draw((7,7)--(7,0)); draw((7,0)--(0,0)); draw((0,6)--(7,6)); draw((0,5)--(7,5)); draw(J_2--(0,4)); draw(H_2--(7,3)); draw((0,2)--(7,2)); draw((0,1)--(7,1)); draw((1,0)--(1,7)); draw((2,7)--(2,0)); draw((3,0)--I_2); draw(K_2--(4,7)); draw((5,0)--(5,7)); draw((6,7)--(6,0)); draw(H_2--I_2); draw(I_2--J_2); draw(J_2--K_2); draw(K_2--H_2); draw(H_2--I_2); draw(I_2--J_2); draw((2.41,6.21)--(6.4,3.2)); draw((5.8,2.4)--(1.81,5.41)); draw((1.2,4.61)--(5.2,1.6)); draw((4.6,0.8)--(0.6,3.8)); draw((3.8,6.4)--(0.8,2.4)); draw((1.61,1.79)--(4.6,5.8)); draw((5.4,5.2)--(2.41,1.19)); draw((3.21,0.59)--(6.2,4.6)); draw((0,7)--(7,7),linewidth(1.2)); draw((7,7)--(7,0),linewidth(1.2)); draw((0,0)--(7,0),linewidth(1.2)); draw((0,7)--(0,0),linewidth(1.2)); dot(H_2,linewidth(4pt)+ds); dot(I_2,linewidth(4pt)+ds); dot(J_2,linewidth(4pt)+ds); dot(K_2,linewidth(4pt)+ds); dot(L_2,linewidth(4pt)+ds); dot(M_2,linewidth(4pt)+ds); dot(N_2,linewidth(4pt)+ds); dot(O_2,linewidth(4pt)+ds); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);[/asy]

Find all functions $f: \mathbb{Q} \mapsto \mathbb{C}$ satisfying (i) For any $x_1, x_2, \ldots, x_{1988} \in \mathbb{Q}$, $f(x_{1} + x_{2} + \ldots + x_{1988}) = f(x_1)f(x_2) \ldots f(x_{1988})$. (ii) $\overline{f(1988)}f(x) = f(1988)\overline{f(x)}$ for all $x \in \mathbb{Q}$.

Let $ A$, $ B$, and $ C$ be three distinct points on the graph of $ y\equal{}x^2$ such that line $ AB$ is parallel to the $ x$-axis and $ \triangle{ABC}$ is a right triangle with area $ 2008$. What is the sum of the digits of the $ y$-coordinate of $ C$? $ \textbf{(A)}\ 16 \qquad \textbf{(B)}\ 17 \qquad \textbf{(C)}\ 18 \qquad \textbf{(D)}\ 19 \qquad \textbf{(E)}\ 20$

Consider all ordered pairs $(m, n)$ of positive integers satisfying $59 m - 68 n = mn$. Find the sum of all the possible values of $n$ in these ordered pairs.