The difference between the product and the sum of two different integers is equal to the sum of their GCD (greatest common divisor) and LCM (least common multiple). Findall these pairs of numbers. Justify your answer.

[b]p1.[/b] Let $X = 2022 + 022 + 22 + 2$. When $X$ is divided by $22$, there is a remainder of $R$. What is the value of $R$? [b]p2.[/b] When Amy makes paper airplanes, her airplanes fly $75\%$ of the time. If her airplane flies, there is a $\frac56$ chance that it won’t fly straight. Given that she makes $80$ airplanes, what is the expected number airplanes that will fly straight? [b]p3.[/b] It takes Joshua working alone $24$ minutes to build a birdhouse, and his son working alone takes $16$ minutes to build one. The effective rate at which they work together is the sum of their individual working rates. How long in seconds will it take them to make one birdhouse together? [b]p4.[/b] If Katherine’s school is located exactly $5$ miles southwest of her house, and her soccer tournament is located exactly $12$ miles northwest of her house, how long, in hours, will it take Katherine to bike to her tournament right after school given she bikes at $0.5$ miles per hour? Assume she takes the shortest path possible. [b]p5.[/b] What is the largest possible integer value of $n$ such that $\frac{4n+2022}{n+1}$ is an integer? [b]p6.[/b] A caterpillar wants to go from the park situated at $(8, 5)$ back home, located at $(4, 10)$. He wants to avoid routes through $(6, 7)$ and $(7, 10)$. How many possible routes are there if the caterpillar can move in the north and west directions, one unit at a time? [b]p7.[/b] Let $\vartriangle ABC$ be a triangle with $AB = 2\sqrt{13}$, $BC = 6\sqrt2$. Construct square $BCDE$ such that $\vartriangle ABC$ is not contained in square $BCDE$. Given that $ACDB$ is a trapezoid with parallel bases $\overline{AC}$, $\overline{BD}$, find $AC$. [b]p8.[/b] How many integers $a$ with $1 \le a \le 1000$ satisfy $2^a \equiv 1$ (mod $25$) and $3^a \equiv 1$ (mod $29$)? [b]p9.[/b] Let $\vartriangle ABC$ be a right triangle with right angle at $B$ and $AB < BC$. Construct rectangle $ADEC$ such that $\overline{AC}$,$\overline{DE}$ are opposite sides of the rectangle, and $B$ lies on $\overline{DE}$. Let $\overline{DC}$ intersect $\overline{AB}$ at $M$ and let $\overline{AE}$ intersect $\overline{BC}$ at $N$. Given $CN = 6$, $BN = 4$, find the $m+n$ if $MN^2$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. [b]p10.[/b] An elimination-style rock-paper-scissors tournament occurs with $16$ players. The $16$ players are all ranked from $1$ to $16$ based on their rock-paper-scissor abilities where $1$ is the best and $16$ is the worst. When a higher ranked player and a lower ranked player play a round, the higher ranked player always beats the lower ranked player and moves on to the next round of the tournament. If the initial order of players are arranged randomly, and the expected value of the rank of the $2$nd place player of the tournament can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$ what is the value of $m+n$? [b]p11.[/b] Estimation (Tiebreaker) Estimate the number of twin primes (pairs of primes that differ by $2$) where both primes in the pair are less than $220022$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$

Find all ordered pairs of positive integers $(m,n)$ such that : $125*2^n-3^m=271$

Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$. [i]Proposed by Warut Suksompong, Thailand[/i]

[b]a)[/b] Solve the system $$ \left\{\begin{matrix} 3^y-4^x=11\\ \log_4{x} +\log_3 y =3/2\end{matrix}\right. $$ [b]b)[/b] Solve the equation $ \quad 9^{\log_5 (x-2)} -5^{\log_9 (x+2)} = 4. $

Determines the largest integer $n$ that is a multiple of all positive integers less than $\sqrt{n}$.

For natural $n$, define $f_n=[2^n\sqrt{69}]+[2^n\sqrt{96}]$ Prove that there are infinite even integers and infinite odd integers that appear in number $f_1,f_2,\dots$. [i](tatari/nightmare)[/i]

Find all natural numbers $n$ greater than $2$ such that there exist $n$ natural numbers $a_{1},a_{2},\ldots,a_{n}$ such that they are not all equal, and the sequence $a_{1}a_{2},a_{2}a_{3},\ldots,a_{n}a_{1}$ forms an arithmetic progression with nonzero common difference.

Are there prime $p$ and $q$ larger than $3$, such that $p^2-1$ is divisible by $q$ and $q^2-1$ divided by $p$?

[i]George the grasshopper[/i] lives of the real line, starting at $0$ . He is given the following sequence of numbers: $2, 3, 4, 8, 9, ... ,$ which are all the numbers of the form $2^k$ or $3^l$, $k, l \in \mathbb{N}$, arranged in increasing order. Starting from $2$, for each number $x$ in the sequence in order, he (currently at $a$) must choose to jump to either $a+x$ or $a-x$. Show that [i]George the grasshopper[/i] can jump in a way that he reaches every integer on the real line.

Let $p$ be the third-smallest prime number greater than $5$ such that: $\bullet$ $2p + 1$ is prime, and $\bullet$ $5^p \not\equiv 1$ (mod $2p + 1$). Find $p$.

Compute the number of distinct pairs of the form \[(\text{first three digits of }x,\text{ first three digits of }x^4)\] over all integers $x>10^{10}$. For example, one such pair is $(100,100)$ when $x=10^{10^{10}}$.

How many positive integers less than $1000$ have the property that the sum of the digits of each such number is divisible by $7$ and the number itself is divisible by $3$?

Nine positive integers $a_1,a_2,...,a_9$ have their last $2$-digit part equal to $11,12,13,14,15,16,17,18$ and $19$ respectively. Find the last $2$-digit part of the sum of their squares.

Let $n$ be an integer of the form $a^2 + b^2$, where $a$ and $b$ are relatively prime integers and such that if $p$ is a prime, $p \leq \sqrt{n}$, then $p$ divides $ab$. Determine all such $n$.

Consider the polynomial $ P(x) \equal{} x^3 \plus{} 153x^2 \minus{} 111x \plus{} 38$. (a) Prove that there are at least nine integers $ a$ in the interval $ [1, 3^{2000}]$ for which $ P(a)$ is divisible by $ 3^{2000}$. (b) Find the number of integers $ a$ in $ [1, 3^{2000}]$ with the property from (a).

Let $p$ be a prime number. Find all positive integers $a,b,c\ge 1$ such that: \[a^p+b^p=p^c.\]

Determine all positive integers $d,$ such that there exists an integer $k\geq 3,$ such that One can arrange the numbers $d,2d,\ldots,kd$ in a row, such that the sum of every two consecutive of them is a perfect square.

Let $\alpha$ be the positive root of the quadratic equation $x^2 = 1990x + 1$. For any $m, n \in \mathbb N$, define the operation $m*n = mn + [\alpha m][ \alpha n]$, where $[x]$ is the largest integer no larger than $x$. Prove that $(p*q)*r = p*(q*r)$ holds for all $p, q, r \in \mathbb N.$

A rectangle with integer side lengths has the property that its area minus $5$ times its perimeter equals $2023$. Find the minimum possible perimeter of this rectangle.

Let $f$ be a bijection of the set of all natural numbers on to itself. Prove that there exists positive integers $a < a+d < a+ 2d$ such that $f(a) < f(a+d) <f(a+2d)$

Determine all pairs of integers $(x, y)$ satisfying the equation \[y(x + y) = x^3- 7x^2 + 11x - 3.\]

Determine all pairs $ (m,n)$ of natural numbers for which $ m^2\equal{}nk\plus{}2$ where $ k\equal{}\overline{n1}$. EDIT. [color=#FF0000]It has been discovered the correct statement is with $ k\equal{}\overline{1n}$.[/color]

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Prove that $F_{n-1}F_{n}F_{n+1}L_{n-1}L_{n}L_{n+1}(n \geq 2)$ is not a perfect square.