Found problems: 545
2017 Brazil National Olympiad, 6.
[b]6.[/b] Let $a$ be a positive integer and $p$ a prime divisor of $a^3-3a+1$, with $p \neq 3$. Prove that $p$ is of the form $9k+1$ or $9k-1$, where $k$ is integer.
1978 IMO Shortlist, 15
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.$
2022 Spain Mathematical Olympiad, 6
Find all triples $(x,y,z)$ of positive integers, with $z>1$, satisfying simultaneously that \[x\text{ divides }y+1,\quad y\text{ divides }z-1,\quad z\text{ divides }x^2+1.\]
2023 4th Memorial "Aleksandar Blazhevski-Cane", P6
Denote by $\mathbb{N}$ the set of positive integers. Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that:
[b]•[/b] For all positive integers $a> 2023^{2023}$ it holds that $f(a) \leq a$.
[b]•[/b] $\frac{a^2f(b)+b^2f(a)}{f(a)+f(b)}$ is a positive integer for all $a,b \in \mathbb{N}$.
[i]Proposed by Nikola Velov[/i]
2018 Israel National Olympiad, 4
The three-digit number 999 has a special property: It is divisible by 27, and its digit sum is also divisible by 27. The four-digit number 5778 also has this property, as it is divisible by 27 and its digit sum is also divisible by 27. How many four-digit numbers have this property?
2019 OMMock - Mexico National Olympiad Mock Exam, 2
Find all pairs of positive integers $(m, n)$ such that $m^2-mn+n^2+1$ divides both numbers $3^{m+n}+(m+n)!$ and $3^{m^3+n^3}+m+n$.
[i]Proposed by Dorlir Ahmeti[/i]
1969 IMO Shortlist, 24
$(GBR 1)$ The polynomial $P(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$, where $a_0,\cdots, a_k$ are integers, is said to be divisible by an integer $m$ if $P(x)$ is a multiple of $m$ for every integral value of $x$. Show that if $P(x)$ is divisible by $m$, then $a_0 \cdot k!$ is a multiple of $m$. Also prove that if $a, k,m$ are positive integers such that $ak!$ is a multiple of $m$, then a polynomial $P(x)$ with leading term $ax^k$can be found that is divisible by $m.$
2008 Germany Team Selection Test, 1
Find all pairs of natural numbers $ (a, b)$ such that $ 7^a \minus{} 3^b$ divides $ a^4 \plus{} b^2$.
[i]Author: Stephan Wagner, Austria[/i]
2019 Switzerland - Final Round, 8
An integer $n\ge2$ is called [i]resistant[/i], if it is coprime to the sum of all its divisors (including $1$ and $n$).
Determine the maximum number of consecutive resistant numbers.
For instance:
* $n=5$ has sum of divisors $S=6$ and hence is resistant.
* $n=6$ has sum of divisors $S=12$ and hence is not resistant.
* $n=8$ has sum of divisors $S=15$ and hence is resistant.
* $n=18$ has sum of divisors $S=39$ and hence is not resistant.
2022 Switzerland Team Selection Test, 6
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.
2024 Bangladesh Mathematical Olympiad, P9
Find all pairs of positive integers $(k, m)$ such that for any positive integer $n$, the product\[(n+m)(n+2m)\cdots(n+km)\]is divisible by $k!$.
1993 IMO Shortlist, 3
Let $a,b,n$ be positive integers, $b > 1$ and $b^n-1\mid a.$ Show that the representation of the number $a$ in the base $b$ contains at least $n$ digits different from zero.
1977 Germany Team Selection Test, 4
When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)
2016 Ukraine Team Selection Test, 7
Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.
2024 Kyiv City MO Round 2, Problem 2
Mykhailo wants to arrange all positive integers from $1$ to $2024$ in a circle so that each number is used exactly once and for any three consecutive numbers $a, b, c$ the number $a + c$ is divisible by $b + 1$. Can he do it?
[i]Proposed by Fedir Yudin[/i]
2020 Israel National Olympiad, 4
At the start of the day, the four numbers $(a_0,b_0,c_0,d_0)$ were written on the board. Every minute, Danny replaces the four numbers written on the board with new ones according to the following rule: if the numbers written on the board are $(a,b,c,d)$, then Danny first calculates the numbers
\begin{align*}
a'&=a+4b+16c+64d\\
b'&=b+4c+16d+64a\\
c'&=c+4d+16a+64b\\
d'&=d+4a+16b+64c
\end{align*}
and replaces the numbers $(a,b,c,d)$ with the numbers $(a'd',c'd',c'b',b'a')$.
For which initial quadruples $(a_0,b_0,c_0,d_0)$, will Danny write at some point a quadruple of numbers all of which are divisible by $5780^{5780}$?
1969 IMO Longlists, 24
$(GBR 1)$ The polynomial $P(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$, where $a_0,\cdots, a_k$ are integers, is said to be divisible by an integer $m$ if $P(x)$ is a multiple of $m$ for every integral value of $x$. Show that if $P(x)$ is divisible by $m$, then $a_0 \cdot k!$ is a multiple of $m$. Also prove that if $a, k,m$ are positive integers such that $ak!$ is a multiple of $m$, then a polynomial $P(x)$ with leading term $ax^k$can be found that is divisible by $m.$
1988 IMO Shortlist, 1
An integer sequence is defined by \[{ a_n = 2 a_{n-1} + a_{n-2}}, \quad (n > 1), \quad a_0 = 0, a_1 = 1.\] Prove that $2^k$ divides $a_n$ if and only if $2^k$ divides $n$.
1978 IMO Longlists, 52
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.$
1976 Bundeswettbewerb Mathematik, 1
Prove that if $n$ is an odd natural number, then $1^n +2^n +\cdots +n^n$ is divisible by $n^2$.
2020 Iran MO (3rd Round), 1
Find all positive integers $n$ such that the following holds.
$$\tau(n)|2^{\sigma(n)}-1$$
1990 IMO Longlists, 22
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.$
2021 Pan-African, 4
Find all integers $m$ and $n$ such that $\frac{m^2+n}{n^2-m}$ and $\frac{n^2+m}{m^2-n}$ are both integers.
2002 USAMO, 5
Let $a,b$ be integers greater than 2. Prove that there exists a positive integer $k$ and a finite sequence $n_1, n_2, \dots, n_k$ of positive integers such that $n_1 = a$, $n_k = b$, and $n_i n_{i+1}$ is divisible by $n_i + n_{i+1}$ for each $i$ ($1 \leq i < k$).
2006 Germany Team Selection Test, 2
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]