Olympiad problems

2020 Final Mathematical Cup, 1

Let $n$ be a given positive integer. Prove that there is no positive divisor $d$ of $2n^2$ such that $d^2n^2+d^3$ is a square of an integer.

2024 Bulgarian Autumn Math Competition, 12.3

Tags: number theory , divisor

Let $n \geq 2$ be a positive integer. If $m$ is a positive integer, for which all of its positive divisors can be split into $n$ disjoint sets of equal sum, prove that $m \geq 2^{n+1}-2$

2016 AMC 12/AHSME, 18

Tags: number theory , divisor

For some positive integer $n$, the number $110n^3$ has $110$ positive integer divisors, including $1$ and the number $110n^3$. How many positive integer divisors does the number $81n^4$ have? $\textbf{(A) }110 \qquad \textbf{(B) } 191 \qquad \textbf{(C) } 261 \qquad \textbf{(D) } 325 \qquad \textbf{(E) } 425$

2003 BAMO, 1

Tags: factorial , perfect number , number theory , divisor

An integer is a perfect number if and only if it is equal to the sum of all of its divisors except itself. For example, $28$ is a perfect number since $28 = 1 + 2 + 4 + 7 + 14$. Let $n!$ denote the product $1\cdot 2\cdot 3\cdot ...\cdot n$, where $n$ is a positive integer. An integer is a factorial if and only if it is equal to $n!$ for some positive integer $n$. For example, $24$ is a factorial number since $24 = 4! = 1\cdot 2\cdot 3\cdot 4$. Find all perfect numbers greater than $1$ that are also factorials.

2016 Saint Petersburg Mathematical Olympiad, 1

Tags: number theory , sequence , divisor , number theory with sequences , integer sequence

In the sequence of integers $(a_n)$, the sum $a_m + a_n$ is divided by $m + n$ with any different $m$ and $n$. Prove that $a_n$ is a multiple of $n$ for any $n$.

1995 Grosman Memorial Mathematical Olympiad, 1

Tags: number theory , divisor

Positive integers $d_1,d_2,...,d_n$ are divisors of $1995$. Prove that there exist $d_i$ and $d_j$ among them, such the denominator of the reduced fraction $d_i/d_j$ is at least $n$

2011 Bosnia And Herzegovina - Regional Olympiad, 3

Tags: divisor , number theory

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$

2016 Switzerland Team Selection Test, Problem 7

Tags: number theory , divisor

Find all positive integers $n$ such that $$\sum_{d|n, 1\leq d <n}d^2=5(n+1)$$

2008 Thailand Mathematical Olympiad, 2

Tags: number theory , divisor

Find all positive integers $N$ with the following properties: (i) $N$ has at least two distinct prime factors, and (ii) if $d_1 < d_2 < d_3 < d_4$ are the four smallest divisors of $N$ then $N =d_1^2 + d_2 ^2+ d_3 ^2+ d_4^2$

1986 Tournament Of Towns, (129) 4

Tags: factorial , number theory , divisible , divisor , divide

We define $N !!$ to be $N(N - 2)(N -4)...5 \cdot 3 \cdot 1$ if $N$ is odd and $N(N -2)(N -4)... 6\cdot 4\cdot 2$ if $N$ is even . For example, $8 !! = 8 \cdot 6\cdot 4\cdot 2$ , and $9 !! = 9v 7 \cdot 5\cdot 3 \cdot 1$ . Prove that $1986 !! + 1985 !!$ i s divisible by $1987$. (V.V . Proizvolov , Moscow)

2022 IFYM, Sozopol, 7

Tags: number theory , divisor

Let’s note the set of all integers $n>1$ which are not divisible by a square of a prime number. We define the number $f(n)$ as the greatest amount of divisors of $n$ which could be chosen in such way so that for each two chosen $a$ and $b$, not necessarily different, the number $a^2+ab+b^2+n$ is not a square. Find all $m$ for which there exists $n$ so that $f(n)=m$.

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

2010 Saudi Arabia Pre-TST, 3.2

Tags: perfect square , number theory , divisor

Prove that among any nine divisors of $30^{2010}$ there are two whose product is a perfect square.

2021 Thailand TSTST, 1

Tags: prime factorization , divisor , number theory

For each positive integer $n$, let $\rho(n)$ be the number of positive divisors of $n$ with exactly the same set of prime divisors as $n$. Show that, for any positive integer $m$, there exists a positive integer $n$ such that $\rho(202^n+1)\geq m.$

2002 Mexico National Olympiad, 5

Tags: number theory , maximum , sum , divisor

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.

2018 Polish Junior MO Finals, 3

Tags: combinatorics , coloring , number theory , divisor

Let $n$ be a positive integer. Each number $1, 2, ..., 1000$ has been colored with one of $n$ colours. Each two numbers , such that one is a divisor of second of them, are colored with different colours. Determine minimal number $n$ for which it is possible.

2022 European Mathematical Cup, 1

Tags: number theory , modular arithmetic , divisibility , divisor

Determine all positive integers $n$ for which there exist positive divisors $a$, $b$, $c$ of $n$ such that $a>b>c$ and $a^2 - b^2$, $b^2 - c^2$, $a^2 - c^2$ are also divisors of $n$.

2015 Latvia Baltic Way TST, 15

Tags: prime divisor , number theory , divisor

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

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

1989 Bundeswettbewerb Mathematik, 4

Tags: egyptian fractions , number theory , divisor

Let $n$ be an odd positive integer. Show that the equation $$ \frac{4}{n} =\frac{1}{x} + \frac{1}{y}$$ has a solution in the positive integers if and only if $n$ has a divisor of the form $4k+3$.

2022 Bulgarian Autumn Math Competition, Problem 10.3

Tags: number theory , divisor

Are there natural number(s) $n$, such that $3^n+1$ has a divisor in the form $24k+20$

2023 IMO, 1

Tags: number theory , divisor

Determine all composite integers $n>1$ that satisfy the following property: if $d_1$, $d_2$, $\ldots$, $d_k$ are all the positive divisors of $n$ with $1 = d_1 < d_2 < \cdots < d_k = n$, then $d_i$ divides $d_{i+1} + d_{i+2}$ for every $1 \leq i \leq k - 2$.

2020 AIME Problems, 9

Tags: probability , divisor

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

2013 Balkan MO Shortlist, N4

Tags: number theory , divisible , sum of powers , divisor

Let $p$ be a prime number greater than $3$. Prove that the sum $1^{p+2} + 2^{p+2} + ...+ (p-1)^{p+2}$ is divisible by $p^2$.

2017 China National Olympiad, 5

Tags: number theory , divisor

Let $D_n$ be the set of divisors of $n$. Find all natural $n$ such that it is possible to split $D_n$ into two disjoint sets $A$ and $G$, both containing at least three elements each, such that the elements in $A$ form an arithmetic progression while the elements in $G$ form a geometric progression.