Olympiad problems

2015 Balkan MO Shortlist, N3

Let $a$ be a positive integer. For all positive integer n, we define $ a_n=1+a+a^2+\ldots+a^{n-1}. $ Let $s,t$ be two different positive integers with the following property: If $p$ is prime divisor of $s-t$, then $p$ divides $a-1$. Prove that number $\frac{a_{s}-a_{t}}{s-t}$ is an integer. (FYROM)

2016 Danube Mathematical Olympiad, 2

Tags: number theory , prime number , divisor

Determine all positive integers $n>1$ such that for any divisor $d$ of $n,$ the numbers $d^2-d+1$ and $d^2+d+1$ are prime. [i]Lucian Petrescu[/i]

2021 Bangladeshi National Mathematical Olympiad, 10

Tags: combinatorics , counting , number theory , divisor

A positive integer $n$ is called [i]nice[/i] if it has at least $3$ proper divisors and it is equal to the sum of its three largest proper divisors. For example, $6$ is [i]nice[/i] because its largest three proper divisors are $3,2,1$ and $6=3+2+1$. Find the number of [i]nice[/i] integers not greater than $3000$.

2024 Alborz Mathematical Olympiad, P1

Tags: number theory , complete residue system , divisor

Find all positive integers $n$ such that if $S=\{d_1,d_2,\cdots,d_k\}$ is the set of positive integer divisors of $n$, then $S$ is a complete residue system modulo $k$. (In other words, for every pair of distinct indices $i$ and $j$, we have $d_i\not\equiv d_j \pmod{k}$). Proposed by Heidar Shushtari

2001 Estonia National Olympiad, 4

Tags: number theory , harmonic , divisor

We call a triple of positive integers $(a, b, c)$ [i]harmonic [/i] if $\frac{1}{a}=\frac{1}{b}+\frac{1}{c}$. Prove that, for any given positive integer $c$, the number of harmonic triples $(a, b, c)$ is equal to the number of positive divisors of $c^2$.

1986 IMO Shortlist, 6

Tags: number theory , prime factorization , divisor

Find four positive integers each not exceeding $70000$ and each having more than $100$ divisors.

2024 AMC 10, 8

Tags: divisor

Let $N$ be the product of all the positive integer divisors of $42$. What is the units digit of $N$? $ \textbf{(A) }0 \qquad \textbf{(B) }2 \qquad \textbf{(C) }4 \qquad \textbf{(D) }6 \qquad \textbf{(E) }8 \qquad $

2001 Estonia National Olympiad, 2

Tags: least common multiple , divide , divisor , number theory

A student wrote a correct addition operation $A/B+C/D = E/F$ on the blackboard, where both summands are irreducible and $F$ is the least common multiple of $B$ and $D$. After that, the student reduced the sum $E/F$ correctly by an integer $d$. Prove that $d$ is a common divisor of $B$ and $D$.

2020 European Mathematical Cup, 2

Tags: number theory , fibonacci , divisor , sequence

A positive integer $k\geqslant 3$ is called[i] fibby[/i] if there exists a positive integer $n$ and positive integers $d_1 < d_2 < \ldots < d_k$ with the following properties: \\ $\bullet$ $d_{j+2}=d_{j+1}+d_j$ for every $j$ satisfying $1\leqslant j \leqslant k-2$, \\ $\bullet$ $d_1, d_2, \ldots, d_k$ are divisors of $n$, \\ $\bullet$ any other divisor of $n$ is either less than $d_1$ or greater than $d_k$. Find all fibby numbers. \\ \\ [i]Proposed by Ivan Novak.[/i]

2002 Junior Balkan Team Selection Tests - Romania, 2

Tags: number theory , diophantine , diophantine equation , divisor

Let $k,n,p$ be positive integers such that $p$ is a prime number, $k < 1000$ and $\sqrt{k} = n\sqrt{p}$. a) Prove that if the equation $\sqrt{k + 100x} = (n + x)\sqrt{p}$ has a non-zero integer solution, then $p$ is a divisor of $10$. b) Find the number of all non-negative solutions of the above equation.

2007 Peru MO (ONEM), 3

Tags: number theory , consecutive , divisor

We say that a natural number of at least two digits $E$ is [i]special [/i] if each time two adjacent digits of $E$ are added, a divisor of $E$ is obtained. For example, $2124$ is special, since the numbers $2 + 1$, $1 + 2$ and $2 + 4$ are all divisors of $2124$. Find the largest value of $n$ for which there exist $n$ consecutive natural numbers such that they are all special.

2023 Israel TST, P2

Tags: number theory , divisor

For each positive integer $n$, define $A(n)$ to be the sum of its divisors, and $B(n)$ to be the sum of products of pairs of its divisors. For example, \[A(10)=1+2+5+10=18\] \[B(10)=1\cdot 2+1\cdot 5+1\cdot 10+2\cdot 5+2\cdot 10+5\cdot 10=97\] Find all positive integers $n$ for which $A(n)$ divides $B(n)$.

2012 Danube Mathematical Competition, 4

Tags: combinatorics , sum , subset , set , divisor

Given a positive integer $n$, show that the set $\{1,2,...,n\}$ can be partitioned into $m$ sets, each with the same sum, if and only if m is a divisor of $\frac{n(n + 1)}{2}$ which does not exceed $\frac{n + 1}{2}$.

1982 Bundeswettbewerb Mathematik, 1

Tags: sum , number theory , divisor

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 Durer Math Competition Finals, 4

Tags: number theory , divisor , perfect square

Show that the divisors of a number $n \ge 2$ can only be divided into two groups in which the product of the numbers is the same if the product of the divisors of $n$ is a square number.

2019 Thailand TST, 1

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.

2004 IMO Shortlist, 1

Tags: equation , divisor , number theory

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

2017 Ecuador Juniors, 5

Tags: number theory , consecutive , coprime , divisor

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

2011 Cuba MO, 3

Tags: number theory , divisor

Let $n$ be a positive integer and let $$1 = d_1 < d_2 < d_3 < d_4$$ the four smallest divisors of $n$. Find all$ n$ such that $$n^2 = d_1 + d_2^2+d_3^3 +d_4^4.$$

2022 European Mathematical Cup, 2

Tags: number theory , divisor , greatest common divisor , divisibility

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?

2014 Contests, 3

Tags: quadratic , number theory , combinatorial number theory , divisor

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

2008 IMO Shortlist, 5

Tags: function , number theory , modular arithmetic , divisor , functional equation

For every $ n\in\mathbb{N}$ let $ d(n)$ denote the number of (positive) divisors of $ n$. Find all functions $ f: \mathbb{N}\to\mathbb{N}$ with the following properties: [list][*] $ d\left(f(x)\right) \equal{} x$ for all $ x\in\mathbb{N}$. [*] $ f(xy)$ divides $ (x \minus{} 1)y^{xy \minus{} 1}f(x)$ for all $ x$, $ y\in\mathbb{N}$.[/list] [i]Proposed by Bruno Le Floch, France[/i]

2002 Junior Balkan Team Selection Tests - Romania, 4

Tags: number theory , integer , divisor

Let $p, q$ be two distinct primes. Prove that there are positive integers $a, b$ such that the arithmetic mean of all positive divisors of the number $n = p^aq^b$ is an integer.

2019 China Team Selection Test, 2

Tags: number theory , divisor

Let $S$ be a set of positive integers, such that $n \in S$ if and only if $$\sum_{d|n,d<n,d \in S} d \le n$$ Find all positive integers $n=2^k \cdot p$ where $k$ is a non-negative integer and $p$ is an odd prime, such that $$\sum_{d|n,d<n,d \in S} d = n$$

2003 Junior Balkan Team Selection Tests - Romania, 3

Tags: number theory , divisor , sum , divide , combinatorics

A set of $2003$ positive integers is given. Show that one can find two elements such that their sum is not a divisor of the sum of the other elements.