Olympiad problems

2003 Olympic Revenge, 5

Let $[n]=\{1,2,...,n\}$.Let $p$ be any prime number. Find how many finite non-empty sets $S\in [p] \times [p]$ are such that $$\displaystyle \large p | \sum_{(x,y) \in S}{x},p | \sum_{(x,y) \in S}{y}$$

2024 Balkan MO, 3

Tags: number theory , divisibility , inequality , inequalities

Let $a$ and $b$ be distinct positive integers such that $3^a + 2$ is divisible by $3^b + 2$. Prove that $a > b^2$. [i]Proposed by Tynyshbek Anuarbekov, Kazakhstan[/i]

2016 Bangladesh Mathematical Olympiad, 2

Tags: number theory , modular arithmetic , divisibility

(a) How many positive integer factors does $6000$ have? (b) How many positive integer factors of $6000$ are not perfect squares?

2021 Baltic Way, 20

Tags: divisibility , least common multiple , number theory

Let $n\ge 2$ be an integer. Given numbers $a_1, a_2, \ldots, a_n \in \{1,2,3,\ldots,2n\}$ such that $\operatorname{lcm}(a_i,a_j)>2n$ for all $1\le i<j\le n$, prove that $$a_1a_2\ldots a_n \mid (n+1)(n+2)\ldots (2n-1)(2n).$$

2015 Romania Team Selection Tests, 1

Tags: sum , divisibility , number theory , gcd

Let $a$ be an integer and $n$ a positive integer . Show that the sum : $$\sum_{k=1}^{n} a^{(k,n)}$$ is divisible by $n$ , where $(x,y)$ is the greatest common divisor of the numbers $x$ and $y$ .

2006 France Team Selection Test, 3

Tags: modular arithmetic , number theory , divisibility , chinese remainder theorem

Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$. [i]Proposed by Mohsen Jamali, Iran[/i]

1974 IMO Longlists, 30

Tags: binomial coefficient , number theory , summation , divisibility , modular arithmetic

Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \] cannot be divided by $5$.

2011 Peru IMO TST, 3

Tags: modular arithmetic , divisibility , number theory

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]

1990 IMO Longlists, 22

Tags: algebra , polynomial , arithmetic sequence , number theory , functional equation , divisibility

Let $ f(0) \equal{} f(1) \equal{} 0$ and \[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\] Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$

2005 Taiwan TST Round 3, 1

Tags: function , number theory , algebra , divisibility , functional equation

Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying \[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\] for any two positive integers $ m$ and $ n$. [i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers: $ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$. By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$). [i]Proposed by Mohsen Jamali, Iran[/i]

2022 SAFEST Olympiad, 2

Tags: integer , number theory , divisibility

Let $n \geq 2$ be an integer. Prove that if $$\frac{n^2+4^n+7^n}{n}$$ is an integer, then it is divisible by 11.

2022 Korea -Final Round, P5

Tags: number theory , divisibility , chinese remainder theorem , quadratic residue , hensel s lemma

Find all positive integers $m$ such that there exists integers $x$ and $y$ that satisfies $$m \mid x^2+11y^2+2022.$$

2011 Belarus Team Selection Test, 3

Tags: modular arithmetic , divisibility , number theory

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]

2013 North Korea Team Selection Test, 3

Tags: modular arithmetic , quadratic , number theory , north korea , divisibility

Find all $ a, b, c \in \mathbb{Z} $, $ c \ge 0 $ such that $ a^n + 2^n | b^n + c $ for all positive integers $ n $ where $ 2ab $ is non-square.

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]

2012 Brazil Team Selection Test, 1

Tags: algorithm , number theory , prime number , divisibility , number of divisors

For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$ [i]Proposed by Suhaimi Ramly, Malaysia[/i]

2021 Macedonian Team Selection Test, Problem 5

Tags: function , divisibility , algebra

Determine all functions $f:\mathbb{N}\to \mathbb{N}$ such that for all $a, b \in \mathbb{N}$ the following conditions hold: $(i)$ $f(f(a)+b) \mid b^a-1$; $(ii)$ $f(f(a))\geq f(a)-1$.

2020-IMOC, N4

Tags: number theory , divisibility

$\textbf{N4:} $ Let $a,b$ be two positive integers such that for all positive integer $n>2020^{2020}$, there exists a positive integer $m$ coprime to $n$ with \begin{align*} \text{ $a^n+b^n \mid a^m+b^m$} \end{align*} Show that $a=b$ [i]Proposed by ltf0501[/i]

2008 Federal Competition For Advanced Students, P1, 1

Tags: binomial coefficient , number theory , divisibility

What is the remainder of the number $1 \binom{2008}{0 }+2\binom{2008}{1}+ ...+2009\binom{2008}{2008}$ when divided by $2008$?

2018 Dutch BxMO TST, 3

Tags: number theory , prime number , divisibility

Let $p$ be a prime number. Prove that it is possible to choose a permutation $a_1, a_2,...,a_p$ of $1,2,...,p$ such that the numbers $a_1, a_1a_2, a_1a_2a_3,..., a_1a_2a_3...a_p$ all have different remainder upon division by $p$.

Kvant 2023, M2775

Tags: number theory , divisibility

Is there an infinite periodic sequence of digits for which the following condition condition is fulfilled: for any natural number $n{}$ a natural number divisible by $2^n{}$ can be cut from this sequence of digits (as a word)? [i]Proposed by P. Kozhevnikov[/i]

2024 India National Olympiad, 3

Tags: number theory , modular arithmetic , divisibility

Let $p$ be an odd prime and $a,b,c$ be integers so that the integers $$a^{2023}+b^{2023},\quad b^{2024}+c^{2024},\quad a^{2025}+c^{2025}$$ are divisible by $p$. Prove that $p$ divides each of $a,b,c$. $\quad$ Proposed by Navilarekallu Tejaswi

2020 AMC 12/AHSME, 4

Tags: divisibility

How many $4$-digit positive integers (that is, integers between $1000$ and $9999$, inclusive) having only even digits are divisible by $5?$ $\textbf{(A) } 80 \qquad \textbf{(B) } 100 \qquad \textbf{(C) } 125 \qquad \textbf{(D) } 200 \qquad \textbf{(E) } 500$

2005 IMO Shortlist, 4

Tags: factorial , modular arithmetic , number theory , divisibility , exponential , chinese remainder theorem

Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property: \[ n!\mid a^n \plus{} 1 \] [i]Proposed by Carlos Caicedo, Colombia[/i]

2012 IMO Shortlist, N6

Tags: modular arithmetic , number theory , divisibility

Let $x$ and $y$ be positive integers. If ${x^{2^n}}-1$ is divisible by $2^ny+1$ for every positive integer $n$, prove that $x=1$.