A natural number $A$ is given. One may add to it one of its divisors $d$ ($1 < d < A$). One may then repeat this operation with the new number $A + d$ and so on. Prove that starting from $A = 4$ one can get any composite number by these operations. (M Vyalyi)

Are there $14$ consecutive positive integers, each of which has a divisor other than $1$ and not exceeding $11$?

Determine all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.

For each positive integer $n$ whose canonical decomposition is $n = p_1^{a_1} \cdot p_2^{a_2} \cdot\cdot\cdot p_k^{a_k}$, we define $t(n) = (p_1 + 1) \cdot (p_2 + 1) \cdot\cdot\cdot (p_k + 1)$. For example, $t(20) = t(2^2\cdot 5^1) = (2 + 1) (5 + 1) = 18$, $t(30) = t(2^1\cdot 3^1\cdot 5^1) = (2 + 1) (3 + 1) (5 + 1) = 72$ and $t(125) = t(5^3) = (5 + 1) = 6$ . We say that a positive integer $n$ is [i]special [/i]if $t(n)$ is a divisor of $n$. How many positive divisors of the number $54610$ are special?

Given a positive integer $n$, let $D$ be the set of all positive divisors of $n$. The subsets $A,B$ of $D$ satisfies that for any $a \in A$ and $b \in B$, it holds that $a \nmid b$ and $b \nmid a$. Show that \[ \sqrt{|A|}+\sqrt{|B|} \le \sqrt{|D|}. \]

Let $w (n)$ denote the number of different prime numbers by which $n$ is divisible. Prove that there are infinitely many natural numbers $n$ such that $w(n) < w(n + 1) < w(n + 2)$.

Show that $1 + 11^{11} + 111^{111} + 1111^{1111} +...+ 1111111111^{1111111111}$ is divisible by $100$.

Determine the smallest prime that does not divide any five-digit number whose digits are in a strictly increasing order.

Determine all pairs $(a, b)$ of integers that satisfy both: 1. $5 \leq b < a$ 2. There exists a natural number $n$ such that the numbers $\frac{a}{b}$ and $a-b$ are consecutive divisors of $n$, in that order. [b]Note:[/b] Two positive integers $x, y$ are consecutive divisors of $m$, in that order, if there is no divisor $d$ of $m$ such that $x < d < y$.

Determine all positive integers $n$ which have a divisor $d$ with the property that $dn + 1$ is a divisor of $d^2 + n^2$.

Let $n\ge 2$ be an integer. Determine the number of positive integers $m$ such that $m\le n$ and $m^2+1$ is divisible by $n$.

Let $n$ be a positive integer. Prove that $n$ is a power of two if and only if there exists an integer $m$ such that $2^n-1$ is a divisor of $m^2 +9$.

Every positive integer is either [i]nice [/i] or [i]naughty[/i], and the Oracle of Numbers knows which are which. However, the Oracle will not directly tell you whether a number is [i]nice [/i] or [i]naughty[/i]. The only questions the Oracle will answer are questions of the form “What is the sum of all nice divisors of $n$?,” where $n$ is a number of the questioner’s choice. For instance, suppose ([i]just [/i] for this example) that $2$ and $3$ are nice, while $1$ and $6$ are [i]naughty[/i]. In that case, if you asked the Oracle, “What is the sum of all nice divisors of $6$?,” the Oracle’s answer would be $5$. Show that for any given positive integer $n$ less than $1$ million, you can determine whether $n$ is [i]nice [/i] or [i]naughty [/i] by asking the Oracle at most four questions.

Find all odd positive integers $ n > 1$ such that if $ a$ and $ b$ are relatively prime divisors of $ n$, then $ a\plus{}b\minus{}1$ divides $ n$.

A positive integer $n$ is [i]acceptable [/i] if the sum of the squares of its proper divisors is equal to $2n+4$ (a divisor of $n$ is [i]proper [/i] if it is different from $1$ and of $n$ ). Find all acceptable numbers less than $10000$,

Let $n$ be a natural integer and let $k$ be the number of ways to write $n$ as the sum of one or more consecutive natural integers. Prove that $k$ is equal to the number of odd positive divisors of $n$. Example: $9$ has three positive odd divisors and $9 = 9$, $9 = 4 + 5$, $9 = 2 + 3 + 4$.

Let $C(n)$ be the number of prime divisors of a positive integer n. (For example, $C(10) = 2,C(11) = 1, C(12) = 2$). Consider set S of all pairs of positive integers $(a, b)$ such that $a\ne b$ and $C(a + b) = C(a) + C(b)$. Is set $S$ finite or infinite?

Find all natural numbers $n$ for which equality holds $n + d (n) + d (d (n)) +... = 2021$, where $d (0) = d (1) = 0$ and for $k> 1$, $ d (k)$ is the [i]superdivisor [/i] of the number $k$ (i.e. its largest divisor of $d$ with property $d <k$). (Tomáš Bárta)

Call a positive integer [i]lonely [/i] if the sum of reciprocals of its divisors (including $1$ and the integer itself) is not equal to the sum of reciprocals of divisors of any other positive integer. Prove that a) all primes are lonely, b) there exist infinitely many non-lonely positive integers.

Find the smallest positive integer $N$ for which the equation $(x^2 -1)(y^2 -1)=N$ is satised by at least two pairs of integers $(x, y)$ with $1 < x \le y$.

Find all possible triples $(a, b, c)$ of positive integers with the following properties: • $gcd(a, b) = gcd(a, c) = gcd(b, c) = 1$, • $a$ is a divisor of $a + b + c$, • $b$ is a divisor of $a + b + c$, • $c$ is a divisor of $a + b + c$. (Here $gcd(x,y)$ is the greatest common divisor of $x$ and $y$.)

Let $1=d_1<d_2<d_3<...<d_k=n$ be all different divisors of positive integer $n$ written in ascending order. Determine all $n$ such that $$d_7^2+d_{10}^2=(n/d_{22})^2.$$

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 all pairs $(n, k)$ of distinct positive integers such that there exists a positive integer $s$ for which the number of divisors of $sn$ and of $sk$ are equal.

For a positive integer $n$, let $s(n)$ and $c(n)$ be the number of divisors of $n$ that are perfect squares and perfect cubes respectively. A positive integer $n$ is called fair if $s(n)=c(n)>1$. Find the number of fair integers less than $100$.