Find all pairs of prime numbers $(p,q)$ for which \[2^p = 2^{q-2} + q!.\]

Sergei chooses two different natural numbers $a$ and $b$. He writes four numbers in a notebook: $a$, $a+2$, $b$ and $b+2$. He then writes all six pairwise products of the numbers of notebook on the blackboard. Let $S$ be the number of perfect squares on the blackboard. Find the maximum value of $S$. [i]S. Berlov[/i]

Find all polynomials $P(x)$ with integer coefficients, such that for any positive integer $n$ number $P(n)$ is a positive integer and a divisor of $n!$. [i]Proposed by Mykyta Kharin[/i]

[u]Round 1[/u] [b]p1. [/b] What is the sum of the digits in the binary representation of $2023$? [b]p2.[/b] Jack is buying fruits at the EMCCmart. Three apples and two bananas cost $\$11.00$. Five apples and four bananas cost $\$19.00$. In cents, how much more does an apple cost than a banana? [b]p3.[/b] Define $a \sim b$ as $a! - ab$. What is $(4 \sim 5) \sim (5 \sim (3 \sim 1))$? [u] Round 2[/u] [b]p4.[/b] Alan has $24$ socks in his drawer. Of these socks, $4$ are red, $8$ are blue, and $12$ are green. Alan takes out socks one at a time from his drawer at random. What is the minimum number of socks he must pull out to guarantee that the number of green socks is at least twice the number of red socks? [b]p5.[/b] What is the remainder when the square of the $24$th smallest prime number is divided by $24$? [b]p6.[/b] A cube and a sphere have the same volume. If $k$ is the ratio of the length of the longest diagonal of the cube to the diameter of the sphere, find $k^6$. [u]Round 3[/u] [b]p7.[/b] Equilateral triangle $ABC$ has side length $3\sqrt3$. Point $D$ is drawn such that $BD$ is tangent to the circumcircle of triangle $ABC$ and $BD = 4$. Find the distance from the circumcenter of triangle $ABC$ to $D$. [b]p8.[/b] If $\frac{2023!}{2^k}$ is an odd integer for an integer $k$, what is the value of $k$? [b]p9.[/b] Let $S$ be a set of 6 distinct positive integers. If the sum of the three smallest elements of $S$ is $8$, and the sum of the three largest elements of $S$ is $19$, find the product of the elements in $S$. [u]Round 4[/u] [b]p10.[/b] For some integers $b$, the number $1 + 2b + 3b^2 + 4b^3 + 5b^4$ is divisible by $b + 1$. Find the largest possible value of $b$. [b]p11.[/b] Let $a, b, c$ be the roots of cubic equation $x^3 + 7x^2 + 8x + 1$. Find $a^2 + b^2 + c^2 + \frac{1}{a} + \frac{1}{b} + \frac{1}{c}$ [b]p12.[/b] Let $C$ be the set of real numbers $c$ such that there are exactly two integers n satisfying $2c < n < 3c$. Find the expected value of a number chosen uniformly at random from $C$. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3131590p28370327]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Natural numbers $ x, y, z $ whose greatest common divisor is equal to 1 satisfy the equation $$\frac{1}{x} + \frac{1}{y} = \frac{1}{z}$$ Prove that $ x + y $ is the square of a natural number.

Show that infinitely many positive integers cannot be written as a sum of three fourth powers of integers.

Find all positive integers $a$ and $b$ such that \[ {a^2+b\over b^2-a}\quad\mbox{and}\quad{b^2+a\over a^2-b} \] are both integers.

Let $S$ be the set of ordered pairs $(x, y)$ such that $0<x\le 1$, $0<y\le 1$, and $\left[\log_2{\left(\frac 1x\right)}\right]$ and $\left[\log_5{\left(\frac 1y\right)}\right]$ are both even. Given that the area of the graph of $S$ is $m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. The notation $[z]$ denotes the greatest integer that is less than or equal to $z$.

A whole number larger than $2$ leaves a remainder of $2$ when divided by each of the numbers $3, 4, 5$ and $6$. The smallest such number lies between which two numbers? $\textbf{(A)}\ 40\text{ and }49\qquad \textbf{(B)}\ 60\text{ and }79\qquad \textbf{(C)}\ 100\text{ and }129\qquad \textbf{(D)}\ 210\text{ and }249\qquad \textbf{(E)}\ 320\text{ and }369$

let $m,n$ be natural number with $m>n$ . find all such pairs of $(m,n) $ such that $gcd(n+1,m+1)=gcd(n+2,m+2) =..........=gcd(m, 2m-n) = 1 $

Find all triples of $ (x, y, z)$ of positive intergers satisfying $ 1\plus{}{4}^{x}\plus{}{4}^{y}\equal{}z^2$.

The set of numbers $M=\{4k-3 | k\in N\}$ is considered. A number of of this set is called “simple” if it is impossible to put in the form of a product of numbers from $M$ other than $1$. Show that in this set, the decomposition of numbers in the product of "simple" factors is ambiguous.

Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ . [i]Proposed by Austria[/i]

Let $(x_1,x_2,\dots,x_{100})$ be a permutation of $(1,2,...,100)$. Define $$S = \{m \mid m\text{ is the median of }\{x_i, x_{i+1}, x_{i+2}\}\text{ for some }i\}.$$ Determine the minimum possible value of the sum of all elements of $S$.

Define the function $f_1$ on the positive integers by setting $f_1(1)=1$ and if $n=p_1^{e_1}p_2^{e_2}...p_k^{e_k}$ is the prime factorization of $n>1$, then \[f_1(n)=(p_1+1)^{e_1-1}(p_2+1)^{e_2-1}\cdots (p_k+1)^{e_k-1}.\] For every $m \ge 2$, let $f_m(n)=f_1(f_{m-1}(n))$. For how many $N$ in the range $1 \le N \le 400$ is the sequence $(f_1(N), f_2(N), f_3(N),...)$ unbounded? [b]Note:[/b] a sequence of positive numbers is unbounded if for every integer $B$, there is a member of the sequence greater than $B$. $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 19 $

Prove that there are infinitely many different natural numbers of the form $k^2 + 1$, $k \in N$ that have no real divisor of this form.

Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.

Prove that the equation $x^2 + y^2 = 1979$ has no integer solutions.

[u]Round 5 [/u] [b]p13.[/b] Suppose $\vartriangle ABC$ is an isosceles triangle with $\overline{AB} = \overline{BC}$, and $X$ is a point in the interior of $\vartriangle ABC$. If $m \angle ABC = 94^o$, $m\angle ABX = 17^o$, and $m\angle BAX = 13^o$, then what is $m\angle BXC$ (in degrees)? [b]p14.[/b] Find the remainder when $\sum^{2019}_{n=1} 1 + 2n + 4n^2 + 8n^3$ is divided by $2019$. [b]p15.[/b] How many ways can you assign the integers $1$ through $10$ to the variables $a, b, c, d, e, f, g, h, i$, and $j$ in some order such that $a < b < c < d < e, f < g < h < i$, $a < g, b < h, c < i$, $f < b, g < c$, and $h < d$? [u]Round 6 [/u] [b]p16.[/b] Call an integer $n$ equi-powerful if $n$ and $n^2$ leave the same remainder when divided by 1320. How many integers between $1$ and $1320$ (inclusive) are equi-powerful? [b]p17.[/b] There exists a unique positive integer $j \le 10$ and unique positive integers $n_j$ , $n_{j+1}$, $...$, $n_{10}$ such that $$j \le n_j < n_{j+1} < ... < n_{10}$$ and $${n_{10} \choose 10}+ {n_9 \choose 9}+ ... + {n_j \choose j}= 2019.$$ Find $n_j + n_{j+1} + ... + n_{10}$. [b]p18.[/b] If $n$ is a randomly chosen integer between $1$ and $390$ (inclusive), what is the probability that $26n$ has more positive factors than $6n$? [u]Round 7[/u] [b]p19.[/b] Suppose $S$ is an $n$-element subset of $\{1, 2, 3, ..., 2019\}$. What is the largest possible value of $n$ such that for every $2 \le k \le n$, $k$ divides exactly $n - 1$ of the elements of $S$? [b]p20.[/b] For each positive integer $n$, let $f(n)$ be the fewest number of terms needed to write $n$ as a sum of factorials. For example, $f(28) = 3$ because $4! + 2! + 2! = 28$ and 28 cannot be written as the sum of fewer than $3$ factorials. Evaluate $f(1) + f(2) + ... + f(720)$. [b]p21.[/b] Evaluate $\sum_{n=1}^{\infty}\frac{\phi (n)}{101^n-1}$ , where $\phi (n)$ is the number of positive integers less than or equal to n that are relatively prime to $n$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2788993p24519281]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all triples (m,n,N) of positive integers numbers m,n and N such that $m^N-n^N=2^{100}$ with N>1

You are given a sequence of $58$ terms; each term has the form $P+n$ where $P$ stands for the product $2 \times 3 \times 5 \times... \times 61$ of all prime numbers less than or equal to $61$, and $n$ takes, successively, the values $2, 3, 4, ...., 59$. let $N$ be the number of primes appearing in this sequence. Then $N$ is: $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 17\qquad\textbf{(D)}\ 57\qquad\textbf{(E)}\ 58 $

Let $n$ be a positive integer. A German set in an $n \times n$ square grid is a set of $n$ cells which contains exactly one cell in each row and column. Given a labelling of thecells with the integers from $1$ to $n^2$ using each integer exactly once, we say that an integer is a German product if it is the product of the labels of the cells in a German set. (a) Let $n=8$. Determine whether there exists a labelling of an $8 \times 8$ grid such that the following condition is fulfilled: The difference of any two German products is alwaysdivisible by $65$. (b) Let $n=10$. Determine whether there exists a labelling of a $10 \times 10$ grid such that the following condition is fulfilled: The difference of any two German products is always divisible by $101$.

Find all pairs of integers $(m, n)$ such that $(m - n)^2 =\frac{4mn}{m + n - 1}$

A positive integer $K$ is given. Define the sequence $(a_n)$ by $a_1 = 1$ and $a_n$ is the $n$-th positive integer greater than $a_{n-1}$ which is congruent to $n$ modulo $K$. [b](a)[/b] Find an explicit formula for $a_n$. [b](b)[/b] What is the result if $K = 2$?

Find all integer solutions of the equation $a^3+3ab^2+7b^3=2011$.