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$

Twenty distinct points are marked on a circle and labeled $1$ through $20$ in clockwise order. A line segment is drawn between every pair of points whose labels differ by a prime number. Find the number of triangles formed whose vertices are among the original $20$ points.

The parabolas $y=x^2+15x+32$ and $x = y^2+49y+593$ meet at one point $(x_0,y_0)$. Find $x_0+y_0$.

Let $ABC$ be an acute-angled triangle and let $P$ be the intersection of the tangents at $B$ and $C$ of the circumscribed circle of $\vartriangle ABC$. The line through $A$ perpendicular on $AB$ and cuts the line perpendicular on $AC$ through $C$ at $X$. The line through $A$ perpendicular on $AC$ cuts the line perpendicular on $AB$ through $B$ at $Y$. Show that $AP \perp XY$.

Prove that for all real numbers $ a,b$ with $ ab>0$ we have: $ \sqrt[3]{\frac{a^2 b^2 (a\plus{}b)^2}{4}} \le \frac{a^2\plus{}10ab\plus{}b^2}{12}$ and find the cases of equality. Hence, or otherwise, prove that for all real numbers $ a,b$ $ \sqrt[3]{\frac{a^2 b^2 (a\plus{}b)^2}{4}} \le \frac{a^2\plus{}ab\plus{}b^2}{3}$ and find the cases of equality.

Given real numbers $(a_i)$ and $(b_i)$ (for $i=1,2,3,4$) such that $a_1 b _2 \ne a_2 b_1 .$ Consider the set of all solutions $(x_1 ,x_2 ,x_3 , x_4)$ of the simultaneous equations $$ a_1 x_1 +a _2 x_2 +a_3 x_3 +a_4 x_4 =0 \;\; \text{and}\;\; b_1 x_1 +b_2 x_2 +b_3 x_3 +b_4 x_4 =0 $$ for which no $x_i$ is zero. Each such solution generates a $4$-tuple of plus and minus signs (by considering the sign of $x_i$). [list=a] [*] Determine, with proof, the maximum number of distinct $4$-tuples possible. [*] Investigate necessary and sufficient conditions on $(a_i)$ and $(b_i)$ such that the above maximum of distinct $4$-tuples is attained.

Point $C$ is a midpoint of $AB$. Circle $o_1$ which passes through $A$ and $C$ intersect circle $o_2$ which passes through $B$ and $C$ in two different points $C$ and $D$. Point $P$ is a midpoint of arc $AD$ of circle $o_1$ which doesn't contain $C$. Point $Q$ is a midpoint of arc $BD$ of circle $o_2$ which doesn't contain $C$. Prove that $PQ \perp CD$.

Find the real values $ m\in\mathbb{R} $ such that all solutions of the equation $$ 1=2mx(2x-1)(2x-2)(2x-3) $$ are real.

Find all functions $f:\mathbb{R}\to \mathbb{R}$ such that for all $x, y\in \mathbb{R}$ the following holds: \[f(x)+f(y)=f(xy)+f(f(x)+f(y))\]

Let $b = \tfrac 12 (-1 + 3\sqrt{5})$. Determine the number of rational numbers which can be written in the form \[ a_{2014}b^{2014} + a_{2013}b^{2013} + \dots + a_1b + a_0 \] where $a_0, a_1, \dots, a_{2014}$ are nonnegative integers less than $b$. [i]Proposed by Michael Kural and Evan Chen[/i]

Find all ordered triples $(a,b, c)$ of real numbers such that $$(a-b)(b-c) + (b-c)(c-a) + (c-a)(a-b) = 0.$$

Let $ABC$ be a fixed triangle. Point $D$ is an arbitrary point on the side $BC$. Point $P$ is fixed on $AD$. The circumcircle of triangle $BPD$ meets $AB$ at $E$ distinct from $B$. Point $Q$ varies on $AP$. Let $BQ$ and $CQ$ meet the circumcircles of triangles $BPD, CPD$ respectively at $F,Z$ distinct from $B,C$. Prove that the circumcircle $EFZ$ is through a fixed point distinct from $E$ and this fixed point is on the circumcircle of triangle $CPD$. Kostas Vittas

In an $n\times{n}$ grid, there are some cats living in each cell (the number of cats in a cell must be a non-negative integer). Every midnight, the manager chooses one cell: (a) The number of cats living in the chosen cell must be greater than or equal to the number of neighboring cells of the chosen cell. (b) For every neighboring cell of the chosen cell, the manager moves one cat from the chosen cell to the neighboring cell. (Two cells are called "neighboring" if they share a common side, e.g. there are only $2$ neighboring cells for a cell in the corner of the grid) Find the minimum number of cats living in the whole grid, such that the manager is able to do infinitely many times of this process.

Let $m$ be a line in the plane and $M$ a point not in $m$. Find the locus of the focus of the parabolas with vertex $M$ that are tangent to $m$.

Given triangle $ABC$ such that $AB- BC = \frac{AC}{\sqrt2}$ . Let $M$ be the midpoint of $AC$, and $N$ be the foot of the angle bisector from $B$. Prove that $\angle BMC + \angle BNC = 90^o$. (A.Akopjan)

Let $f(x)$ be the polynomial $\prod_{k=1}^{50} \bigl( x - (2k-1) \bigr)$. Let $c$ be the coefficient of $x^{48}$ in $f(x)$. When $c$ is divided by 101, what is the remainder? (The remainder is an integer between 0 and 100.)

In the triangle $ABC$ the incircle is tangent to the sides $AB$ and $AC$ at $D$ and $E$ respectively. The line $DE$ intersects the circumcircle at $P$ and $Q$, with $P$ in the small arc $AB$ and $Q$ in the small arc $AC$. If $P$ is the midpoint of the arc $AB$, find the angle A and the ratio $\frac{PQ}{BC}$.

Jackson's paintbrush makes a narrow strip that is $6.5$ mm wide. Jackson has enough paint to make a strip of 25 meters. How much can he paint, in $\text{cm}^2$? $\textbf{(A) }162{,}500\qquad\textbf{(B) }162.5\qquad\textbf{(C) }1{,}625\qquad\textbf{(D) }1{,}625{,}000\qquad\textbf{(E) }16{,}250$

For a given number $ n $, let us denote by $ p_n $ the probability that when randomly selecting a pair of integers $ k, m $ satisfying the conditions $ 0 \leq k \leq m \leq 2^n $ (the selection of each pair is equally probable) the number $\binom{m}{k}$ will be even. Calculate $ \lim_{n\to \infty} p_n $.

[b]p1.[/b] For what integers $x$ is it possible to find an integer $y$ such that $$x(x + 1) (x + 2) (x + 3) + 1 = y^2 ?$$ [b]p2.[/b] Two tangents to a circle are parallel and touch the circle at points $A$ and $B$, respectively. A tangent to the circle at any point $X$, other than $A$ or $B$, meets the first tangent at $Y$ and the second tangent at $Z$. Prove $AY \cdot BZ$ is independent of the position of $X$. [b]p3.[/b] If $a, b, c$ are positive real numbers, prove that $$8abc \le (b + c) (c + a) (a + b)$$ by first verifying the relation in the special case when $c = b$. [b]p4.[/b] Solve the equation $$\frac{x^2}{3}+\frac{48}{x^2}=10 \left( \frac{x}{3}-\frac{4}{x}\right)$$ [b]p5.[/b] Tom and Bill live on the same street. Each boy has a package to deliver to the other boy’s house. The two boys start simultaneously from their own homes and meet $600$ yards from Bill's house. The boys continue on their errand and they meet again $700$ yards from Tom's house. How far apart do the boy's live? [b]p6.[/b] A standard set of dominoes consists of $28$ blocks of size $1$ by $2$. Each block contains two numbers from the set $0,1,2,...,6$. We can denote the block containing $2$ and $3$ by $[2, 3]$, which is the same block as $[3, 2]$. The blocks $[0, 0]$, $[1, 1]$,..., $[6, 6]$ are in the set but there are no duplicate blocks. a) Show that it is possible to arrange the twenty-eight dominoes in a line, end-to-end, with adjacent ends matching, e. g., $... [3, 1]$ $[1, 1]$ $[1, 0]$ $[0, 6] ...$ . b) Consider the set of dominoes which do not contain $0$. Show that it is impossible to arrange this set in such a line. c) Generalize the problem and prove your generalization. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $N$ be a ten digit positive integer divisible by $7$. Suppose the first and the last digit of $N$ are interchanged and the resulting number (not necessarily ten digit) is also divisible by $7$ then we say that $N$ is a good integer. How many ten digit good integers are there?

Find the number of permutations $(a_1, a_2, . . . , a_{2013})$ of $(1, 2, \dots , 2013)$ such that there are exactly two indices $i \in \{1, 2, \dots , 2012\}$ where $a_i < a_{i+1}$.

Suppose that a sequence $t_{0}, t_{1}, t_{2}, ...$ is defined by a formula $t_{n} = An^{2} +Bn +c$ for all integers $n \geq 0$. Here $A, B$ and $C$ are real constants with $A \neq 0$. Determine values of $A, B$ and $C$ which give the greatest possible number of successive terms of the Fibonacci sequence.[i] The Fibonacci sequence is defined by[/i] $F_{0} = 0, F_{1} = 1$ [i]and[/i] $F_{m} = F_{m-1} + F_{m-2}$ [i]for[/i] $m \geq 2$.

Prove that the number $$\sqrt{1 + \frac{1}{n^2} + \frac{1}{(n+1)^2}}$$ is rational for all natural $n$.

For $m\ge 3,$ a list of $\binom m3$ real numbers $a_{ijk}$ $(1\le i<j<k\le m)$ is said to be [i]area definite[/i] for $\mathbb{R}^n$ if the inequality \[\sum_{1\le i<j<k\le m}a_{ijk}\cdot\text{Area}(\triangle A_iA_jA_k)\ge0\] holds for every choice of $m$ points $A_1,\dots,A_m$ in $\mathbb{R}^n.$ For example, the list of four numbers $a_{123}=a_{124}=a_{134}=1, a_{234}=-1$ is area definite for $\mathbb{R}^2.$ Prove that if a list of $\binom m3$ numbers is area definite for $\mathbb{R}^2,$ then it is area definite for $\mathbb{R}^3.$