Found problems: 196
2014 Contests, 3
We denote the number of positive divisors of a positive integer $m$ by $d(m)$ and the number of distinct prime divisors of $m$ by $\omega(m)$. Let $k$ be a positive integer. Prove that there exist infinitely many positive integers $n$ such that $\omega(n) = k$ and $d(n)$ does not divide $d(a^2+b^2)$ for any positive integers $a, b$ satisfying $a + b = n$.
2001 All-Russian Olympiad, 4
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$.
1982 Bundeswettbewerb Mathematik, 1
Let $S$ be the sum of the greatest odd divisors of the natural numbers $1$ through $2^n$. Prove that $3S = 4^n + 2$.
2022 All-Russian Olympiad, 1
We call the $main$ $divisors$ of a composite number $n$ the two largest of its natural divisors other than $n$. Composite numbers $a$ and $b$ are such that the main divisors of $a$ and $b$ coincide. Prove that $a=b$.
2022 European Mathematical Cup, 2
We say that a positive integer $n$ is lovely if there exist a positive integer $k$ and (not necessarily distinct) positive integers $d_1$, $d_2$, $\ldots$, $d_k$ such that $n = d_1d_2\cdots d_k$ and $d_i^2 \mid n + d_i$ for $i=1,2,\ldots,k$.
a) Are there infinitely many lovely numbers?
b) Is there a lovely number, greater than $1$, which is a perfect square of an integer?
2002 Mexico National Olympiad, 5
A [i]trio [/i] is a set of three distinct integers such that two of the numbers are divisors or multiples of the third. Which [i]trio [/i] contained in $\{1, 2, ... , 2002\}$ has the largest possible sum? Find all [i]trios [/i] with the maximum sum.
2017 Ecuador Juniors, 5
Two positive integers are coprime if their greatest common divisor is $1$. Let $C$ be the set of all divisors of the number $8775$ that are greater than $ 1$. A set of $k$ consecutive positive integers satisfies that each of them is coprime with some element of $C$. Determine the largest possible value of $K$.
1995 May Olympiad, 1
Veronica, Ana and Gabriela are forming a round and have fun with the following game. One of them chooses a number and says out loud, the one to its left divides it by its largest prime divisor and says the result out loud and so on. The one who says the number out loud $1$ wins , at which point the game ends. Ana chose a number greater than $50$ and less than $100$ and won. Veronica chose the number following the one chosen by Ana and also won. Determine all the numbers that could have been chosen by Ana.
2014 Rioplatense Mathematical Olympiad, Level 3, 4
A pair (a,b) of positive integers is [i]Rioplatense [/i]if it is true that $b + k$ is a multiple of $a + k$ for all $k \in\{ 0 , 1 , 2 , 3 , 4 \}$. Prove that there is an infinite set $A$ of positive integers such that for any two elements $a$ and $b$ of $A$, with $a < b$, the pair $(a,b)$ is [i]Rioplatense[/i].
2019 Tournament Of Towns, 1
Let us call the number of factors in the prime decomposition of an integer $n > 1$ the complexity of $n$. For example, [i]complexity [/i] of numbers $4$ and $6$ is equal to $2$. Find all $n$ such that all integers between $n$ and $2n$ have complexity
a) not greater than the complexity of $n$.
b) less than the complexity of $n$.
(Boris Frenkin)
2004 Estonia Team Selection Test, 5
Find all natural numbers $n$ for which the number of all positive divisors of the number lcm $(1,2,..., n)$ is equal to $2^k$ for some non-negative integer $k$.
1992 Austrian-Polish Competition, 1
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.
2018 Regional Competition For Advanced Students, 4
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]
2020 AIME Problems, 9
Let $S$ be the set of positive integer divisors of $20^9.$ Three numbers are chosen independently and at random from the set $S$ and labeled $a_1,a_2,$ and $a_3$ in the order they are chosen. The probability that both $a_1$ divides $a_2$ and $a_2$ divides $a_3$ is $\frac mn,$ where $m$ and $n$ are relatively prime positive integers. Find $m.$
2014 Switzerland - Final Round, 9
The sequence of integers $a_1, a_2, ,,$ is defined as follows:
$$a_n=\begin{cases} 0\,\,\,\, if\,\,\,\, n\,\,\,\, has\,\,\,\, an\,\,\,\, even\,\,\,\, number\,\,\,\, of\,\,\,\, divisors\,\,\,\, greater\,\,\,\, than\,\,\,\, 2014 \\ 1 \,\,\,\, if \,\,\,\, n \,\,\,\, has \,\,\,\, an \,\,\,\, odd \,\,\,\, number \,\,\,\, of \,\,\,\, divisors \,\,\,\, greater \,\,\,\, than \,\,\,\, 2014\end{cases}$$
Show that the sequence $a_n$ never becomes periodic.
2025 Kyiv City MO Round 2, Problem 3
A positive integer \( n \), which has at least one proper divisor, is divisible by the arithmetic mean of the smallest and largest of its proper divisors (which may coincide). What can be the number of divisors of \( n \)?
[i]A proper divisor of a positive integer \( n \) is any of its divisors other than \( 1 \) and \( n \).[/i]
[i]Proposed by Mykhailo Shtandenko[/i]
1985 Poland - Second Round, 2
Prove that for a natural number $ n > 2 $ the number $ n! $ is the sum of its $ n $ various divisors.
2013 Dutch Mathematical Olympiad, 4
For a positive integer n the number $P(n)$ is the product of the positive divisors of $n$. For example, $P(20) = 8000$, as the positive divisors of $20$ are $1, 2, 4, 5, 10$ and $20$, whose product is $1 \cdot 2 \cdot 4 \cdot 5 \cdot 10 \cdot 20 = 8000$.
(a) Find all positive integers $n$ satisfying $P(n) = 15n$.
(b) Show that there exists no positive integer $n$ such that $P(n) = 15n^2$.
2012 Tournament of Towns, 2
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?
1997 Singapore MO Open, 3
Find all the natural numbers $N$ which satisfy the following properties:
(i) $N$ has exactly $6$ distinct factors $1, d_1, d_2, d_3, d_4, N$ and
(ii) $1 + N = 5(d_1 + d_2+d_3 + d_4)$.
Justify your answers.
1983 IMO Longlists, 4
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.
2019 Bosnia and Herzegovina EGMO TST, 2
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$.
2024 Baltic Way, 16
Determine all composite positive integers $n$ such that, for each positive divisor $d$ of $n$, there are integers $k\geq 0$ and $m\geq 2$ such that $d=k^m+1$.
2005 AIME Problems, 3
How many positive integers have exactly three proper divisors, each of which is less than 50?
2000 IMO Shortlist, 2
For a positive integer $n$, let $d(n)$ be the number of all positive divisors of $n$. Find all positive integers $n$ such that $d(n)^3=4n$.