This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 545

1990 IMO Shortlist, 21
Tags: number theory , divisibility , binary representation , minimization
Let $ n$ be a composite natural number and $ p$ a proper divisor of $ n.$ Find the binary representation of the smallest natural number $ N$ such that \[ \frac{(1 \plus{} 2^p \plus{} 2^{n\minus{}p})N \minus{} 1}{2^n}\] is an integer.

2021 Cyprus JBMO TST, 1
Tags: divisibility , number theory
Find all positive integers $n$, such that the number \[ \frac{n^{2021}+101}{n^2+n+1}\] is an integer.

1988 IMO Shortlist, 9
Tags: number theory , divisibility , diophantine equation , perfect square , vieta jumping
Let $ a$ and $ b$ be two positive integers such that $ a \cdot b \plus{} 1$ divides $ a^{2} \plus{} b^{2}$. Show that $ \frac {a^{2} \plus{} b^{2}}{a \cdot b \plus{} 1}$ is a perfect square.

1996 Estonia Team Selection Test, 1
Tags: number theory , divisibility , perfect cube
Suppose that $x,y$ and $\frac{x^2+y^2+6}{xy}$ are positive integers . Prove that $\frac{x^2+y^2+6}{xy}$ is a perfect cube.

2015 Turkey MO (2nd round), 1
Tags: number theory , divisibility , perfect square
$m$ and $n$ are positive integers. If the number \[ k=\dfrac{(m+n)^2}{4m(m-n)^2+4}\] is an integer, prove that $k$ is a perfect square.

2023 239 Open Mathematical Olympiad, 5
Tags: number theory , divisibility
Let $a{}$ and $b>1$ be natural numbers. Prove that there exists a natural number $n < b^2$ such that the number $a^n + n$ is divisible by $b{}$.

1969 IMO Shortlist, 43
Tags: modular arithmetic , number theory , divisibility
$(MON 4)$ Let $p$ and $q$ be two prime numbers greater than $3.$ Prove that if their difference is $2^n$, then for any two integers $m$ and $n,$ the number $S = p^{2m+1} + q^{2m+1}$ is divisible by $3.$

2019 IFYM, Sozopol, 5
Tags: number theory , divisibility , greatest common divisor , modulo
Prove that there exist a natural number $a$, for which 999 divides $2^{5n}+a.5^n$ for $\forall$ odd $n\in \mathbb{N}$ and find the smallest such $a$.

2021 Bolivian Cono Sur TST, 1
Tags: number theory , divisibility
Find the sum of all positive integers $n$ such that $$\frac{n+11}{\sqrt{n-1}}$$ is an integer.

2015 Danube Mathematical Competition, 3
Tags: divisibility , rmn
Determine all positive integers $n$ such that all positive integers less than or equal to $n$ and relatively prime to $n$ are pairwise coprime.

2009 Germany Team Selection Test, 2
Tags: number theory , modular arithmetic , sequence , divisibility
Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]

1984 IMO Longlists, 40
Tags: algebra , polynomial , modular arithmetic , number theory , divisibility
Find one pair of positive integers $a,b$ such that $ab(a+b)$ is not divisible by $7$, but $(a+b)^7-a^7-b^7$ is divisible by $7^7$.

2023 239 Open Mathematical Olympiad, 2
Tags: number theory , divisibility
Let $1 < a_1 < a_2 < \cdots < a_N$ be natural numbers. It is known that for any $1\leqslant i\leqslant N$ the product of all these numbers except $a_i$ increased by one, is a multiple of $a_i$. Prove that $a_1\leqslant N$.

2014 JBMO TST - Macedonia, 3
Tags: number theory , digit , divisibility
Find all positive integers $n$ which are divisible by 11 and satisfy the following condition: all the numbers which are generated by an arbitrary rearrangement of the digits of $n$, are also divisible by 11.

2015 Cono Sur Olympiad, 5
Tags: number theory , divisibility , sequence
Determine if there exists an infinite sequence of not necessarily distinct positive integers $a_1, a_2, a_3,\ldots$ such that for any positive integers $m$ and $n$ where $1 \leq m < n$, the number $a_{m+1} + a_{m+2} + \ldots + a_{n}$ is not divisible by $a_1 + a_2 + \ldots + a_m$.

2003 IMO Shortlist, 1
Tags: modular arithmetic , number theory , sequence , divisibility
Let $m$ be a fixed integer greater than $1$. The sequence $x_0$, $x_1$, $x_2$, $\ldots$ is defined as follows: \[x_i = \begin{cases}2^i&\text{if }0\leq i \leq m - 1;\\\sum_{j=1}^mx_{i-j}&\text{if }i\geq m.\end{cases}\] Find the greatest $k$ for which the sequence contains $k$ consecutive terms divisible by $m$ . [i]Proposed by Marcin Kuczma, Poland[/i]

2022 JBMO TST - Turkey, 1
Tags: number theory , divisibility , integer
For positive integers $a$ and $b$, if the expression $\frac{a^2+b^2}{(a-b)^2}$ is an integer, prove that the expression $\frac{a^3+b^3}{(a-b)^3}$ is an integer as well.

1977 IMO Longlists, 10
Tags: number theory , additive number theory , remainder , divisibility
Let $a,b$ be two natural numbers. When we divide $a^2+b^2$ by $a+b$, we the the remainder $r$ and the quotient $q.$ Determine all pairs $(a, b)$ for which $q^2 + r = 1977.$

2007 IMO Shortlist, 6
Tags: quadratic , number theory , vieta jumping , divisibility
Let $ k$ be a positive integer. Prove that the number $ (4 \cdot k^2 \minus{} 1)^2$ has a positive divisor of the form $ 8kn \minus{} 1$ if and only if $ k$ is even. [url=http://www.mathlinks.ro/viewtopic.php?p=894656#894656]Actual IMO 2007 Problem, posed as question 5 in the contest, which was used as a lemma in the official solutions for problem N6 as shown above.[/url] [i]Author: Kevin Buzzard and Edward Crane, United Kingdom [/i]

2020 Moldova Team Selection Test, 6
Tags: divisibility , algebra
Let $n$, $(n \geq3)$ be a positive integer and the polynomial $f(x)=(1+x) \cdot (1+2x) \cdot (1+3x) \cdot ... \cdot (1+nx)$ $= a_0+a_1 \cdot x+a_2 \cdot x^2+a_3 \cdot x^3+...+a_n \cdot x^n$. Show that the number $a_3$ divides the number $k=C^2_{n+1} \cdot (2 \cdot C^2_n \cdot C^2_{n+1}-3 \cdot a_2).$

2016 Greece Team Selection Test, 1
Tags: number theory , sequence , divisibility
Given is the sequence $(a_n)_{n\geq 0}$ which is defined as follows:$a_0=3$ and $a_{n+1}-a_n=n(a_n-1) \ , \ \forall n\geq 0$. Determine all positive integers $m$ such that $\gcd (m,a_n)=1 \ , \ \forall n\geq 0$.

2010 Germany Team Selection Test, 3
Tags: modular arithmetic , number theory , sequence , divisibility
Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$. [i]Proposed by North Korea[/i]

2024 Polish Junior MO Finals, 5
Tags: divisibility , multiple , digit , number theory
Let $S=\underbrace{111\dots 1}_{19}\underbrace{999\dots 9}_{19}$. Show that the $2S$-digit number \[\underbrace{111\dots 1}_{S}\underbrace{999\dots 9}_{S}\] is a multiple of $19$.

2007 Bulgarian Autumn Math Competition, Problem 9.4
Tags: number theory , divisibility
Find the smallest natural number, which divides $2^{n}+15$ for some natural number $n$ and can be expressed in the form $3x^2-4xy+3y^2$ for some integers $x$ and $y$.

2015 IFYM, Sozopol, 1
Tags: number theory , prime number , divisibility
Let $p$, $q$ be two distinct prime numbers and $n$ be a natural number, such that $pq$ divides $n^{pq}+1$. Prove that, if $p^3 q^3$ divides $n^{pq}+1$, then $p^2$ or $q^2$ divides $n+1$.