Found problems: 536
2024 Kyiv City MO Round 1, Problem 3
Let $n>1$ be a given positive integer. Petro and Vasyl play the following game. They take turns making moves and Petro goes first. In one turn, a player chooses one of the numbers from $1$ to $n$ that wasn't selected before and writes it on the board. The first player after whose turn the product of the numbers on the board will be divisible by $n$ loses. Who wins if every player wants to win? Find answer for each $n>1$.
[i]Proposed by Mykhailo Shtandenko, Anton Trygub[/i]
2001 Mongolian Mathematical Olympiad, Problem 3
Let $a,b$ be coprime positive integers with $a$ even and $a>b$. Show that there exist infinitely many pairs $(m,n)$ of coprime positive integers such that $m\mid a^{n-1}-b^{n-1}$ and $n\mid a^{m-1}-b^{m-1}$.
2012 India Regional Mathematical Olympiad, 2
Prove that for all positive integers $n$, $169$ divides $21n^2 + 89n + 44$ if $13$ divides $n^2 + 3n + 51$.
2018 Brazil Team Selection Test, 3
Let $n > 10$ be an odd integer. Determine the number of ways to place the numbers $1, 2, \ldots , n$ around a circle so that each number in the circle divides the sum its two neighbors.
(Two configurations such that one can be obtained from the other per rotation are to be counted only once.)
2018 Polish Junior MO First Round, 3
Prime numbers $a, b, c$ are bigger that $3$. Show that $(a - b)(b - c)(c - a)$ is divisible by $48$.
2014 EGMO, 4
Determine all positive integers $n\geq 2$ for which there exist integers $x_1,x_2,\ldots ,x_{n-1}$ satisfying the condition that if $0<i<n,0<j<n, i\neq j$ and $n$ divides $2i+j$, then $x_i<x_j$.
2003 German National Olympiad, 6
Prove that there are infinitely many coprime, positive integers $a,b$ such that $a$ divides $b^2 -5$ and $b$ divides $a^2 -5.$
2008 Germany Team Selection Test, 3
Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$.
[i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]
1969 IMO Longlists, 34
$(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$
2014 German National Olympiad, 2
For a positive integer $n$, let $y_n$ be the number of $n$-digit positive integers containing only the digits $2,3,5, 7$ and which do not have a $5$ directly to the right of a $2.$ If $r\geq 1$ and $m\geq 2$ are integers, prove that $y_{m-1}$ divides $y_{rm-1}.$
1983 IMO Longlists, 9
Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.
1991 IMO Shortlist, 13
Given any integer $ n \geq 2,$ assume that the integers $ a_1, a_2, \ldots, a_n$ are not divisible by $ n$ and, moreover, that $ n$ does not divide $ \sum^n_{i\equal{}1} a_i.$ Prove that there exist at least $ n$ different sequences $ (e_1, e_2, \ldots, e_n)$ consisting of zeros or ones such $ \sum^n_{i\equal{}1} e_i \cdot a_i$ is divisible by $ n.$
1983 IMO Shortlist, 5
Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.
2003 IMO Shortlist, 1
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]
1969 IMO Shortlist, 19
$(FRA 2)$ Let $n$ be an integer that is not divisible by any square greater than $1.$ Denote by $x_m$ the last digit of the number $x^m$ in the number system with base $n.$ For which integers $x$ is it possible for $x_m$ to be $0$? Prove that the sequence $x_m$ is periodic with period $t$ independent of $x.$ For which $x$ do we have $x_t = 1$. Prove that if $m$ and $x$ are relatively prime, then $0_m, 1_m, . . . , (n-1)_m$ are different numbers. Find the minimal period $t$ in terms of $n$. If n does not meet the given condition, prove that it is possible to have $x_m = 0 \neq x_1$ and that the sequence is periodic starting only from some number $k > 1.$
2025 All-Russian Olympiad, 11.3
A pair of polynomials \(F(x, y)\) and \(G(x, y)\) with integer coefficients is called $\emph{important}$ if from the divisibility of both differences \(F(a, b) - F(c, d)\) and \(G(a, b) - G(c, d)\) by $100$, it follows that both \(a - c\) and \(b - d\) are divisible by 100. Does there exist such an important pair of polynomials \(P(x, y)\), \(Q(x, y)\), such that the pair \(P(x, y) - xy\) and \(Q(x, y) + xy\) is also important?
KoMaL A Problems 2020/2021, A. 787
Let $p_n$ denote the $n^{\text{th}}$ prime number and define $a_n=\lfloor p_n\nu\rfloor$ for all positive integers $n$ where $\nu$ is a positive irrational number. Is it possible that there exist only finitely many $k$ such that $\binom{2a_k}{a_k}$ is divisible by $p_i^{10}$ for all $i=1,2,\ldots,2020?$
[i]Proposed by Superguy and ayan.nmath[/i]
1978 IMO Longlists, 23
Let $S$ be the set of all the odd positive integers that are not multiples of $5$ and that are less than $30m$, $m$ being an arbitrary positive integer. What is the smallest integer $k$ such that in any subset of $k$ integers from $S$ there must be two different integers, one of which divides the other?
Kvant 2020, M2616
Let $p>5$ be a prime number. Prove that the sum \[\left(\frac{(p-1)!}{1}\right)^p+\left(\frac{(p-1)!}{2}\right)^p+\cdots+\left(\frac{(p-1)!}{p-1}\right)^p\]is divisible by $p^3$.
2022 OlimphÃada, 1
Let $p,q$ prime numbers such that $$p+q \mid p^3-q^3$$
Show that $p=q$.
1992 IMO Longlists, 2
Let $m$ be a positive integer and $x_0, y_0$ integers such that $x_0, y_0$ are relatively prime, $y_0$ divides $x_0^2+m$, and $x_0$ divides $y_0^2+m$. Prove that there exist positive integers $x$ and $y$ such that $x$ and $y$ are relatively prime, $y$ divides $x^2 + m$, $x$ divides $y^2 + m$, and $x + y \leq m+ 1.$
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.$
2019 Bundeswettbewerb Mathematik, 2
The lettes $A,C,F,H,L$ and $S$ represent six not necessarily distinct decimal digits so that $S \ne 0$ and $F \ne 0$. We form the two six-digit numbers $SCHLAF$ and $FLACHS$.
Show that the difference of these two numbers is divisible by $271$ if and only if $C=L$ and $H=A$.
[i]Remark:[/i] The words "Schlaf" and "Flachs" are German for "sleep" and "flax".
2021 Science ON Seniors, 2
Find all pairs $(p,q)$ of prime numbers such that
$$p^q-4~|~q^p-1.$$
[i](Vlad Robu)[/i]
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.