Olympiad problems

2022 Kazakhstan National Olympiad, 6

Given an infinite positive integer sequence $\{x_i\}$ such that $$x_{n+2}=x_nx_{n+1}+1$$ Prove that for any positive integer $i$ there exists a positive integer $j$ such that $x_j^j$ is divisible by $x_i^i$. [i]Remark: Unfortunately, there was a mistake in the problem statement during the contest itself. In the last sentence, it should say "for any positive integer $i>1$ ..."[/i]

1969 IMO Shortlist, 28

Tags: polynomial , number theory , sequence , divisibility , recurrence relation

$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$

2011 IMO Shortlist, 6

Tags: algebra , polynomial , number theory , divisibility

Let $P(x)$ and $Q(x)$ be two polynomials with integer coefficients, such that no nonconstant polynomial with rational coefficients divides both $P(x)$ and $Q(x).$ Suppose that for every positive integer $n$ the integers $P(n)$ and $Q(n)$ are positive, and $2^{Q(n)}-1$ divides $3^{P(n)}-1.$ Prove that $Q(x)$ is a constant polynomial. [i]Proposed by Oleksiy Klurman, Ukraine[/i]

2015 Indonesia MO Shortlist, N3

Tags: divisibility , number theory

Given positive integers $a,b,c,d$ such that $a\mid c^d$ and $b\mid d^c$. Prove that \[ ab\mid (cd)^{max(a,b)} \]

2021 Polish Junior MO Finals, 5

Tags: digit , divisibility , number theory

Natural numbers $a$, $b$ are written in decimal using the same digits (i.e. every digit from 0 to 9 appears the same number of times in $a$ and in $b$). Prove that if $a+b=10^{1000}$ then both numbers $a$ and $b$ are divisible by $10$.

1974 IMO Shortlist, 6

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

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

2012 Bosnia And Herzegovina - Regional Olympiad, 2

Tags: number theory , divisibility

Let $a$, $b$, $c$ and $d$ be integers such that $ac$, $bd$ and $bc+ad$ are divisible with positive integer $m$. Show that numbers $bc$ and $ad$ are divisible with $m$

2017 Iran MO (3rd round), 1

Tags: number theory , divisibility , prime number , prime

Let $n$ be a positive integer. Consider prime numbers $p_1,\dots ,p_k$. Let $a_1,\dots,a_m$ be all positive integers less than $n$ such that are not divisible by $p_i$ for all $1 \le i \le n$. Prove that if $m\ge 2$ then $$\frac{1}{a_1}+\dots+\frac{1}{a_m}$$ is not an integer.

1969 IMO Longlists, 34

Tags: number theory , divisibility

$(HUN 1)$ Let $a$ and $b$ be arbitrary integers. Prove that if $k$ is an integer not divisible by $3$, then $(a + b)^{2k}+ a^{2k} +b^{2k}$ is divisible by $a^2 +ab+ b^2$

2009 IMO Shortlist, 6

Tags: algebra , polynomial , sequence , number theory , divisibility

Let $k$ be a positive integer. Show that if there exists a sequence $a_0,a_1,\ldots$ of integers satisfying the condition \[a_n=\frac{a_{n-1}+n^k}{n}\text{ for all } n\geq 1,\] then $k-2$ is divisible by $3$. [i]Proposed by Okan Tekman, Turkey[/i]

2015 IMO Shortlist, N2

Tags: factorial , number theory , divisibility

Let $a$ and $b$ be positive integers such that $a! + b!$ divides $a!b!$. Prove that $3a \ge 2b + 2$.

Russian TST 2014, P1

Tags: number theory , divisibility , prime number

Let $p{}$ be a prime number and $x_1,x_2,\ldots,x_p$ be integers for which $x_1^n+x_2^n+\cdots+x_p^n$ is divisible by $p{}$ for any positive integer $n{}$. Prove that $x_1-x_2$ is divisible by $p{}.$

2023 Romania National Olympiad, 1

Tags: number theory , divisibility

The non-zero natural number n is a perfect square. By dividing $2023$ by $n$, we obtain the remainder $223- \frac{3}{2} \cdot n$. Find the quotient of the division.

2017 Regional Competition For Advanced Students, 4

Tags: number theory , sum of squares , divisibility , divisor

Determine all integers $n \geq 2$, satisfying $$n=a^2+b^2,$$ where $a$ is the smallest divisor of $n$ different from $1$ and $b$ is an arbitrary divisor of $n$. [i]Proposed by Walther Janous[/i]

2016 Serbia National Math Olympiad, 1

Tags: number theory , divisibility

Let $n>1$ be an integer. Prove that there exist $m>n^n $ such that $\frac {n^m-m^n}{m+n} $ is a positive integer.

2011 N.N. Mihăileanu Individual, 1

Tags: number theory , divisibility

[b]a)[/b] Prove that $ 4040100 $ divides $ 2009\cdot 2011^{2011}+1. $ [i]Gabriel Iorgulescu[/i] [b]b)[/b] Let be three natural numbers $ x,y,z $ with the property that $ (1+\sqrt 2)^x=y^2+2z^2+2yz\sqrt 2. $ Show that $ x $ is even. [i]Marius Cavachi[/i]

2016 Taiwan TST Round 2, 1

Tags: factorial , number theory , divisibility

Let $a$ and $b$ be positive integers such that $a! + b!$ divides $a!b!$. Prove that $3a \ge 2b + 2$.

2011 China National Olympiad, 3

Tags: modular arithmetic , algorithm , prime number , divisibility , number theory

Let $m,n$ be positive integer numbers. Prove that there exist infinite many couples of positive integer nubmers $(a,b)$ such that \[a+b| am^a+bn^b , \quad\gcd(a,b)=1.\]

1978 IMO Longlists, 52

Tags: modular arithmetic , algebra , polynomial , divisibility , number theory

Let $p$ be a prime and $A = \{a_1, \ldots , a_{p-1} \}$ an arbitrary subset of the set of natural numbers such that none of its elements is divisible by $p$. Let us define a mapping $f$ from $\mathcal P(A)$ (the set of all subsets of $A$) to the set $P = \{0, 1, \ldots, p - 1\}$ in the following way: $(i)$ if $B = \{a_{i_{1}}, \ldots , a_{i_{k}} \} \subset A$ and $\sum_{j=1}^k a_{i_{j}} \equiv n \pmod p$, then $f(B) = n,$ $(ii)$ $f(\emptyset) = 0$, $\emptyset$ being the empty set. Prove that for each $n \in P$ there exists $B \subset A$ such that $f(B) = n.$

2014 Contests, 3

Tags: number theory , divisibility

Let $1000 \leq n = \text{ABCD}_{10} \leq 9999$ be a positive integer whose digits $\text{ABCD}$ satisfy the divisibility condition: $$1111 | (\text{ABCD} + \text{AB} \times \text{CD}).$$ Determine the smallest possible value of $n$.

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

2002 Federal Math Competition of S&M, Problem 3

Tags: number theory , divisibility

Let $m$ and $n$ be positive integers. Prove that the number $2n-1$ is divisible by $(2^m-1)^2$ if and only if $n$ is divisible by $m(2^m-1)$.

2024 Romania Team Selection Tests, P3

Tags: number theory , divisibility

Let $n{}$ be a positive integer and let $a{}$ and $b{}$ be positive integers congruent to 1 modulo 4. Prove that there exists a positive integer $k{}$ such that at least one of the numbers $a^k-b$ and $b^k-a$ is divisible by $2^n.$ [i]Cătălin Liviu Gherghe[/i]

2020 Macedonia Additional BMO TST, 3

Tags: number theory , divisibility

Does there exist a set of $2020$ distinct positive whole numbers with the property that the product of any $101$ of them is divisible by the sum of those $101$ numbers?

2022 Greece Team Selection Test, 1

Tags: number theory , divisibility , cubefree

Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$