Olympiad problems

2008 Korea Junior Math Olympiad, 6

If $d_1,d_2,...,d_k$ are all distinct positive divisors of $n$, we define $f_s(n) = d_1^s+d_2^s+..+d_k^s$. For example, we have $f_1(3) = 1 + 3 = 4, f_2(4) = 1 + 2^2 + 4^2 = 21$. Prove that for all positive integers $n$, $n^3f_1(n) - 2nf_9(n) + n^2f_3(n)$ is divisible by $8$.

2017 Bosnia And Herzegovina - Regional Olympiad, 4

Tags: number theory , number of divisors , divisor

It is given positive integer $N$. Let $d_1$, $d_2$,...,$d_n$ be its divisors and let $a_i$ be number of divisors of $d_i$, $i=1,2,...n$. Prove that $$(a_1+a_2+...+a_n)^2={a_1}^3+{a_2}^3+...+{a_n}^3$$

2016 Flanders Math Olympiad, 2

Tags: power , number theory , divide , divisor

Determine the smallest natural number $n$ such that $n^n$ is not a divisor of the product $1\cdot 2\cdot 3\cdot ... \cdot 2015\cdot 2016$.

2019 Estonia Team Selection Test, 9

Tags: number theory , arithmetic function , number of divisors , divisor

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.

2017 Iberoamerican, 5

Tags: combinatorics , divisor

Given a positive integer $n$, all of its positive integer divisors are written on a board. Two players $A$ and $B$ play the following game: Each turn, each player colors one of these divisors either red or blue. They may choose whichever color they wish, but they may only color numbers that have not been colored before. The game ends once every number has been colored. $A$ wins if the product of all of the red numbers is a perfect square, or if no number has been colored red, $B$ wins otherwise. If $A$ goes first, determine who has a winning strategy for each $n$.

2009 Estonia Team Selection Test, 6

Tags: number theory , divisor , product

For any positive integer $n$, let $c(n)$ be the largest divisor of $n$ not greater than $\sqrt{n}$ and let $s(n)$ be the least integer $x$ such that $n < x$ and the product $nx$ is divisible by an integer $y$ where $n < y < x$. Prove that, for every $n$, $s(n) = (c(n) + 1) \cdot \left( \frac{n}{c(n)}+1\right)$

1956 Moscow Mathematical Olympiad, 323

Tags: number theory , divisor , divide

a) Find all integers that can divide both the numerator and denominator of the ratio $\frac{5m + 6}{8m + 7}$ for an integer $m$. b) Let $a, b, c, d, m$ be integers. Prove that if the numerator and denominator of the ratio $\frac{am + b}{cm+ d}$ are both divisible by $k$, then so is $ad - bc$.

2011 Bosnia And Herzegovina - Regional Olympiad, 3

Tags: number theory , divisor

If $n$ is a positive integer and $n+1$ is divisible with $24$, prove that sum of all positive divisors of $n$ is divisible with $24$

2018 Danube Mathematical Competition, 2

Tags: number theory , infinitely many , divisor

Prove that there are infinitely many pairs of positive integers $(m, n)$ such that simultaneously $m$ divides $n^2 + 1$ and $n$ divides $m^2 + 1$.

1983 IMO Longlists, 4

Tags: number theory , sum of divisors , inequality , divisor

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.