In how many ways can the numbers from $2$ to $2022$ be arranged so that the first number is a multiple of $1$, the second number is a multiple of $2$, the third number is a multiple of $3$, and so on untile the last number is a multiple of $2021$?

Wendy takes Honors Biology at school, a smallish class with only fourteen students (including Wendy) who sit around a circular table. Wendy's friends Lucy, Starling, and Erin are also in that class. Last Monday none of the fourteen students were absent from class. Before the teacher arrived, Lucy and Starling stretched out a blue piece of yarn between them. Then Wendy and Erin stretched out a red piece of yarn between them at about the same height so that the yarn would intersect if possible. If all possible positions of the students around the table are equally likely, let $m/n$ be the probability that the yarns intersect, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$.

Prove that there exists a subset $S$ of positive integers such that we can represent each positive integer as difference of two elements of $S$ in exactly one way.

Let $p,q,r$ be prime numbers such that $2p>q$, $q > 2r$ and $q>p+r$. Prove that $p+q+r\ge 20$.

Let $a$ be a positive integer such that $5^{1994}-1\mid a$. Prove that the expression of $a$ in base $5$ contains at least $1994$ nonzero digits.

For the integer $n>1$, define $D(n)=\{ a-b\mid ab=n, a>b>0, a,b\in\mathbb{N} \}$. Prove that for any integer $k>1$, there exists pairwise distinct positive integers $n_1,n_2,\ldots,n_k$ such that $n_1,\ldots,n_k>1$ and $|D(n_1)\cap D(n_2)\cap\cdots\cap D(n_k)|\geq 2$.

We denote by $S(k)$ the sum of digits of a positive integer number $k$. We say that the positive integer $a$ is $n$-good, if there is a sequence of positive integers $a_0$, $a_1, \dots , a_n$, so that $a_n = a$ and $a_{i + 1} = a_i -S (a_i)$ for all $i = 0, 1,. . . , n-1$. Is it true that for any positive integer $n$ there exists a positive integer $b$, which is $n$-good, but not $(n + 1)$-good? A. Antropov

Integers $a, b, c$ satisfy $a+b-c=1$ and $a^2+b^2-c^2=-1$. What is the sum of all possible values of $a^2+b^2+c^2$ ?

Let $p$ be an odd prime number. For every integer $a,$ define the number $S_a = \sum^{p-1}_{j=1} \frac{a^j}{j}.$ Let $m,n \in \mathbb{Z},$ such that $S_3 + S_4 - 3S_2 = \frac{m}{n}.$ Prove that $p$ divides $m.$ [i]Proposed by Romeo Meštrović, Montenegro[/i]

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

Given a positive integer $n > 1$. Find the smallest integer of the form $\frac{n^a-n^b}{n^c-n^d}$ for all positive integers $a,b,c,d$.

Prove that among any $n$ positive integers one can always find some (at least one) whose sum is divisible by $n$.

The positive integers \( a \) and \( b \) are coprime and such that there exist positive integers \( m_2 \) and \( m_5 \) for which \( am_2 + b \) is a perfect square of a positive integer, and \( am_5 + b \) is a perfect fifth power of a positive integer. Does there always exist a positive integer \( n \) for which \( an + b \) is a perfect \( k \)-th power of a positive integer, if: a) \( k = 7 \); b) \( k = 10 \)?

Let $p$ be a prime integer greater than $10^k$. Pete took some multiple of $p$ and inserted a $k-$digit integer $A$ between two of its neighbouring digits. The resulting integer C was again a multiple of $p$. Pete inserted a $k-$digit integer $B$ between two of neighbouring digits of $C$ belonging to the inserted integer $A$, and the result was again a multiple of $p$. Prove that the integer $B$ can be obtained from the integer $A$ by a permutation of its digits. [i](8 points)[/i] [i]Ilya Bogdanov[/i]

Determine the number of positive integers $n \leq 1000$ such that the sum of the digits of $5n$ and the sum of the digits of $n$ are the same.

Let $n$ be a positive integer and let $d_1, d_2, \dots, d_k$ be its positive divisors. Consider the number $$f(n) = (-1)^{d_1}d_1 + (-1)^{d_2}d_2 + \dots + (-1)^{d_k}d_k$$ Assume $f(n)$ is a power of 2. Show if $m$ is an integer greater than 1, then $m^2$ does not divide $n$.

Let $A=\{1,2,3,\cdots ,17\}$. A mapping $f:A\rightarrow A$ is defined as follows: $f^{[1]}(x)=f(x), f^{[k+1]}(x)=f(f^{[k]}(x))$ for $k\in\mathbb{N}$. Suppose that $f$ is bijective and that there exists a natural number $M$ such that: i) when $m<M$ and $1\le i\le 16$, we have $f^{[m]}(i+1)- f^{[m]}(i) \not=\pm 1\pmod{17}$ and $f^{[m]}(1)- f^{[m]}(17) \not=\pm 1\pmod{17}$; ii) when $1\le i\le 16$, we have $f^{[M]}(i+1)- f^{[M]}(i)=\pm 1 \pmod{17}$ and $f^{[M]}(1)- f^{[M]}(17)=\pm 1\pmod{17}$. Find the maximal value of $M$.

Let $S(a)$ denote the sum of the digits of the number $a$. Given a natural $R$ can one find a natural $n$ such that $\frac{S (n^2)}{S (n)}= R$?

[u]Round 9[/u] [b]p25. [/b]Define a sequence $\{a_n\}_{n \ge 1}$ of positive real numbers by $a_1 = 2$ and $a^2_n -2a_n +5 =4a_{n-1}$ for $n \ge 2$. Suppose $k$ is a positive real number such that $a_n <k$ for all positive integers $n$. Find the minimum possible value of $k$. [b]p26.[/b] Let $\vartriangle ABC$ be a triangle with $AB = 13$, $BC = 14$, and $C A = 15$. Suppose the incenter of $\vartriangle ABC$ is $I$ and the incircle is tangent to $BC$ and $AB$ at $D$ and $E$, respectively. Line $\ell$ passes through the midpoints of $BD$ and $BE$ and point $X$ is on $\ell$ such that $AX \parallel BC$. Find $X I$ . [b]p27.[/b] Let $x, y, z$ be positive real numbers such that $x y + yz +zx = 20$ and $x^2yz +x y^2z +x yz^2 = 100$. Additionally, let $s = \max (x y, yz,xz)$ and $m = \min(x, y, z)$. If $s$ is maximal, find $m$. [u]Round 10[/u] [b]p28.[/b] Let $\omega_1$ be a circle with center $O$ and radius $1$ that is internally tangent to a circle $\omega_2$ with radius $2$ at $T$ . Let $R$ be a point on $\omega_1$ and let $N$ be the projection of $R$ onto line $TO$. Suppose that $O$ lies on segment $NT$ and $\frac{RN}{NO} = \frac4 3$ . Additionally, let $S$ be a point on $\omega_2$ such that $T,R,S$ are collinear. Tangents are drawn from $S$ to $\omega_1$ and touch $\omega_1$ at $P$ and $Q$. The tangent to $\omega_1$ at $R$ intersects $PQ$ at $Z$. Find the area of triangle $\vartriangle ZRS$. [b]p29.[/b] Let $m$ and $n$ be positive integers such that $k =\frac{ m^2+n^2}{mn-1}$ is also a positive integer. Find the sum of all possible values of $k$. [b]p30.[/b] Let $f_k (x) = k \cdot \ min (x,1-x)$. Find the maximum value of $k \le 2$ for which the equation $f_k ( f_k ( f_k (x))) = x$ has fewer than $8$ solutions for $x$ with $0 \le x \le 1$. [u]Round 11[/u] In the following problems, $A$ is the answer to Problem $31$, $B$ is the answer to Problem $32$, and $C$ is the answer to Problem $33$. For this set, you should find the values of $A$,$B$, and $C$ and submit them as answers to problems $31$, $32$, and $33$, respectively. Although these answers depend on each other, each problem will be scored separately. [b]p31.[/b] Find $$A \cdot B \cdot C + \dfrac{1}{B+ \dfrac{1}{C +\dfrac{1}{B+\dfrac{1}{...}}}}$$ [b]p32.[/b] Let $D = 7 \cdot B \cdot C$. An ant begins at the bottom of a unit circle. Every turn, the ant moves a distance of $r$ units clockwise along the circle, where $r$ is picked uniformly at random from the interval $\left[ \frac{\pi}{2D} , \frac{\pi}{D} \right]$. Then, the entire unit circle is rotated $\frac{\pi}{4}$ radians counterclockwise. The ant wins the game if it doesn’t get crushed between the circle and the $x$-axis for the first two turns. Find the probability that the ant wins the game. [b]p33.[/b] Let $m$ and $n$ be the two-digit numbers consisting of the products of the digits and the sum of the digits of the integer $2016 \cdot B$, respectively. Find $\frac{n^2}{m^2 - mn}$. [u]Round 12[/u] [b]p34.[/b] There are five regular platonic solids: the tetrahedron, cube, octahedron, dodecahedron, and icosahedron. For each of these solids, define its adjacency angle to be the dihedral angle formed between two adjacent faces. Estimate the sum of the adjacency angles of all five solids, in degrees. If your estimate is $E$ and the correct answer is $A$, your score for this problem will be $\max \left(0, \lfloor 15 -\frac12 |A-E| \rfloor \right).$ [b]p35.[/b] Estimate the value of $$\log_{10} \left(\prod_{k|2016} k!\right), $$ where the product is taken over all positive divisors $k$ of $2016$. If your estimate is $E$ and the correct answer is $A$, your score for this problem will be $\max \left(0, \lceil 15 \cdot \min \left(\frac{E}{A}, 2- \frac{E}{A}\right) \rceil \right).$ [b]p36.[/b] Estimate the value of $\sqrt{2016}^{\sqrt[4]{2016}}$. If your estimate is $E$ and the correct answer is $A$, your score for this problem will be $\max \left(0, \lceil 15 \cdot \min \left(\frac{\ln E}{\ln A}, 2- \frac{\ln E}{\ln A}\right) \rceil \right).$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3158461p28714996]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3158474p28715078]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a$ and $n$ be two integers greater than $1$. Prove that if $n$ divides $(a-1)^k$ for some integer $k\geq 2$, then $n$ also divides $a^{n-1}+a^{n-2}+\cdots+a+1$.

Find the minimum positive value of $ 1*2*3*4*...*2020*2021*2022$ where you can replace $*$ as $+$ or $-$

Find all integers $n \ge 2$ for which there exists an integer $m$ and a polynomial $P(x)$ with integer coefficients satisfying the following three conditions: [list] [*]$m > 1$ and $\gcd(m,n) = 1$; [*]the numbers $P(0)$, $P^2(0)$, $\ldots$, $P^{m-1}(0)$ are not divisible by $n$; and [*]$P^m(0)$ is divisible by $n$. [/list] Here $P^k$ means $P$ applied $k$ times, so $P^1(0) = P(0)$, $P^2(0) = P(P(0))$, etc. [i]Carl Schildkraut[/i]

Evaluate the sum of all three digits number which are not divisible by $13$ .

$p$ is a prime number such that its remainder divided by 8 is 3. Find all pairs of rational numbers $(x,y)$ that satisfy the following equation. $$p^2 x^4-6px^2+1=y^2$$

Let u be a fixed positive integer. Prove that the equation $n! = u^{\alpha} - u^{\beta}$ has a finite number of solutions $(n, \alpha, \beta).$