Given that $x$ and $y$ are positive integers such that $xy^{433}$ is a perfect 2016-power of a positive integer, prove that $x^{433}y$ is also a perfect 2016-power.

Find the number of integer $n$ from the set $\{2000,2001,...,2010\}$ such that $2^{2n} + 2^n + 5$ is divisible by $7$ (A): $0$, (B): $1$, (C): $2$, (D): $3$, (E) None of the above.

An odd prime $p$ is called a prime of the year $2022$ if there is a positive integer $n$ such that $p^{2022}$ divides $n^{2022}+2022$. Show that there are infinitely many primes of the year $2022$.

Prove that there are only [b]finitely[/b] positive integer $a$ such that $a-2006=\sum\limits_{i=1}^{2006} 2^ia_i$ with $\{a_i\}$ as divisors (not necessary distinct) of $n$.

Find all positive $k$ such that product of the first $k$ odd prime numbers, reduced by 1 is exactly degree of natural number (which more than one).

For each positive integer $k$, denote by $P (k)$ the number of all positive integers $4k$-digit numbers which can be composed of the digits $2, 0$ and which are divisible by the number $2 020$. Prove the inequality $$P (k) \ge \binom{2k - 1}{k}^2$$ and determine all $k$ for which equality occurs. (Note: A positive integer cannot begin with a digit of $0$.) (Jaromir Simsa)

Given an integer $n \geq 2$, determine all $n$-digit numbers $M_0 = \overline{a_1a_2 \cdots a_n} \ (a_i \neq 0, i = 1, 2, . . ., n)$ divisible by the numbers $M_1 = \overline{a_2a_3 \cdots a_na_1}$ , $M_2 = \overline{a_3a_4 \cdots a_na_1 a_2}$, $\cdots$ , $M_{n-1} = \overline{a_na_1a_2 . . .a_{n-1}}.$

Given any two real numbers $\alpha$ and $\beta , 0 \leq \alpha < \beta \leq 1$, prove that there exists a natural number $m$ such that \[\alpha < \frac{\phi(m)}{m} < \beta.\]

Show that ${2n \choose n} \; \vert \; \text{lcm}(1,2, \cdots, 2n)$ for all positive integers $n$.

Let $O, M, P$ and $D$ be distinct digits from each other, and different from zero, such that $O < M < P < D$, and the following equation is true: \[ \overline{\text{OMPD}} \times \left( \overline{\text{OM}} - \overline{\text{D}} \right) = \overline{\text{MDDMP}} - \overline{\text{OM}} \] (a) Using estimates, explain why it is impossible for the value of $O$ to be greater than or equal to $3$. (b) Explain why $O$ cannot be equal to $1$. (c) Is it possible for $M$ to be greater than or equal to $5$? Justify. (d) Determine the values of $M$, $P$, and $D$.

Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]

Find all triples $(x,y,z)$ of positive integers satisfying the system of equations \[\begin{cases} x^2=2(y+z)\\ x^6=y^6+z^6+31(y^2+z^2)\end{cases}\]

For any natural $n$ , define $n!!=(n!)!$ e.g. $3!!=(3!)!=6!=720$. Let $a_1,a_2,...,a_n$ be a positive integer Prove that $$\frac{(a_1+a_2+\cdots+a_n)!!}{a_1!!a_2!!\cdots a_n!!}$$ is an integer. [i](nooonuii)[/i]

Let $a_1,a_2,a_3, \cdots $ be distinct positive integers, and $0<c<\frac{3}{2}$ . Prove that : There exist infinitely many positive integers $k$, such that $[a_k,a_{k+1}]>ck $.

Equilateral triangle $ T$ is inscribed in circle $ A$, which has radius $ 10$. Circle $ B$ with radius $ 3$ is internally tangent to circle $ A$ at one vertex of $ T$. Circles $ C$ and $ D$, both with radius $ 2$, are internally tangent to circle $ A$ at the other two vertices of $ T$. Circles $ B$, $ C$, and $ D$ are all externally tangent to circle $ E$, which has radius $ \frac {m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$. [asy]unitsize(2.2mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=4; pair A=(0,0), D=8*dir(330), C=8*dir(210), B=7*dir(90); pair Ep=(0,4-27/5); pair[] dotted={A,B,C,D,Ep}; draw(Circle(A,10)); draw(Circle(B,3)); draw(Circle(C,2)); draw(Circle(D,2)); draw(Circle(Ep,27/5)); dot(dotted); label("$E$",Ep,E); label("$A$",A,W); label("$B$",B,W); label("$C$",C,W); label("$D$",D,E);[/asy]

A number is called [i]Norwegian[/i] if it has three distinct positive divisors whose sum is equal to $2022$. Determine the smallest Norwegian number. (Note: The total number of positive divisors of a Norwegian number is allowed to be larger than $3$.)

Katie and Allie are playing a game. Katie rolls two fair six-sided dice and Allie flips two fair two-sided coins. Katie’s score is equal to the sum of the numbers on the top of the dice. Allie’s score is the product of the values of two coins, where heads is worth $4$ and tails is worth $2.$ What is the probability Katie’s score is strictly greater than Allie’s?

Find all primes that can be written both as a sum and as a difference of two primes (note that $ 1$ is not a prime).

Let $m$ and $n$ be positive integers such that $5m+ n$ is a divisor of $5n +m$. Prove that $m$ is a divisor of $n$.

$a, b, c, d$ are integers. Show that $x^2 + ax + b = y^2 + cy + d$ has infinitely many integer solutions iff $a^2 - 4b = c^2 - 4d$.

Given prime numbers $p$ and $q.$ a) Assume that $2^xq=p^y+1,$ with $x,y$ are integers greater than $1$. Can $x$ be a composite number? b) Assume that $2^uq=p^v-1,$ with $u$ is a prime number and $v$ is an integer greater than $1$. Find all possible values of $p.$

Does there exist an integer $A$ such that each of the ten digits $0, 1, . . . , 9$ appears exactly once as a digit in exactly one of the numbers $A, A^2, A^ 3$ ?

Let us consider a simle graph with vertex set $ V$. All ordered pair $ (a,b)$ of integers with $ gcd(a,b) \equal{} 1$, are elements of V. $ (a,b)$ is connected to $ (a,b \plus{} kab)$ by an edge and to $ (a \plus{} kab,b)$ by another edge for all integer k. Prove that for all $ (a,b)\in V$, there exists a path fromm $ (1,1)$ to $ (a,b)$.

Xenia and Sergey play the following game. Xenia thinks of a positive integer $N$ not exceeding $5000$. Then she fixes $20$ distinct positive integers $a_1, a_2, \cdots, a_{20}$ such that, for each $k = 1,2,\cdots,20$, the numbers $N$ and $a_k$ are congruent modulo $k$. By a move, Sergey tells Xenia a set $S$ of positive integers not exceeding $20$, and she tells him back the set $\{a_k : k \in S\}$ without spelling out which number corresponds to which index. How many moves does Sergey need to determine for sure the number Xenia thought of? [i]Sergey Kudrya, Russia[/i]

Call a k-digit positive integer a [i]hyperprime[/i] if all its segments consisting of $ 1, 2, ..., k$ consecutive digits are prime. Find all hyperprimes.