Let $1 = d_1 < d_2 < ...< d_k = n$ be all natural divisors of the natural number $n$. Find all possible values ​​of the number $k$ if $n=d_2d_3 + d_2d_5+d_3d_5$.

For each positive integer $n$, let $d(n)$ be the number of positive integer divisors of $n$. Prove that for all pairs of positive integers $(a,b)$ we have that: \[ d(a)+d(b) \le d(\gcd(a,b))+d(\text{lcm}(a,b)) \] and determine all pairs of positive integers $(a,b)$ where we have equality case.

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?

Find all composite positive integers $a{}$ for which there exists a positive integer $b\geqslant a$ with the same number of divisors as $a{}$ with the following property: if $a_1<\cdots<a_n$ and $b_1<\cdots<b_n$ are the proper divisors of $a{}$ and $b{}$ respectively, then $a_i+b_i, 1\leqslant i\leqslant n$ are the proper divisors of some positive integer $c.{}$

Let $n$ be a positive integer. Let $D_n$ be the set of all divisors of $n$ and let $f(n)$ denote the smallest natural $m$ such that the elements of $D_n$ are pairwise distinct in mod $m$. Show that there exists a natural $N$ such that for all $n \geq N$, one has $f(n) \leq n^{0.01}$.

For a natural number $n$, denote by $s(n)$ the sum of all positive divisors of n. Prove that for every $n > 1$ the product $s(n - 1)s(n)s(n + 1)$ is even.

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$.

El Chapulín observed that the number $2014$ has an unusual property. By placing its eight positive divisors in increasing order, the fifth divisor is equal to three times the third minus $4$. A number of eight divisors with this unusual property is called the [i]red[/i] number . How many [i]red[/i] numbers smaller than $2014$ exist?

Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.

Let $n$ be a positive integer. Let $\sigma(n)$ be the sum of the natural divisors $d$ of $n$ (including $1$ and $n$). We say that an integer $m \geq 1$ is [i]superabundant[/i] (P.Erdos, $1944$) if $\forall k \in \{1, 2, \dots , m - 1 \}$, $\frac{\sigma(m)}{m} >\frac{\sigma(k)}{k}.$ Prove that there exists an infinity of [i]superabundant[/i] numbers.

Let $d(n)$ be the number of all positive divisors of a natural number $n \ge 2$. Determine all natural numbers $n \ge 3$ such that $d(n -1) + d(n) + d(n + 1) \le 8$. [i]Proposed by Richard Henner[/i]

An integer $n > 1$ has the following property: for every (positive) divisor $d$ of $n, d + 1$ is a divisor of $n + 1$. Prove that $n$ is prime.

Let $d(n)$ denote the number of positive divisors of $n$. For positive integer $n$ we define $f(n)$ as $$f(n) = d\left(k_1\right) + d\left(k_2\right)+ \cdots + d\left(k_m\right),$$ where $1 = k_1 < k_2 < \cdots < k_m = n$ are all divisors of the number $n$. We call an integer $n > 1$ [i]almost perfect[/i] if $f(n) = n$. Find all almost perfect numbers. [i]Paulius Ašvydis[/i]

Let a pair of positive integers $(n, m)$ that are relatively prime be called [i]intertwined[/i] if among any two divisors of $n$ greater than $1$, there exists a divisor of $m$ and among any two divisors of $m$ greater than $1$, there exists a divisor of $n$. For example, pair $(63, 64)$ is intertwined. [b]a)[/b] Find the largest integer $k$ for which there exists an intertwined pair $(n, m)$ such that the product $nm$ is equal to the product of the first $k$ prime numbers. [b]b)[/b] Prove that there does [b]not[/b] exist an intertwined pair $(n, m)$ such that the product $nm$ is the product of $2025$ distinct prime numbers. [b]c)[/b] Prove that there exists an intertwined pair $(n, m)$ such that the number of divisors of $n$ is greater than $2025$. [i]Proposed by Stijn Cambie, Belgium[/i]

a) Is it possible that the sum of all the positive divisors of two different natural numbers are equal? b) Is it possible that the product of all the positive divisors of two different natural numbers are equal?

A positive integer n is called [i]primary divisor [/i] if for every positive divisor $d$ of $n$ at least one of the numbers $d - 1$ and $d + 1$ is prime. For example, $8$ is divisor primary, because its positive divisors $1$, $2$, $4$, and $8$ each differ by $1$ from a prime number ($2$, $3$, $5$, and $7$, respectively), while $9$ is not divisor primary, because the divisor $9$ does not differ by $1$ from a prime number (both $8$ and $10$ are composite). Determine the largest primary divisor number.