Found problems: 97
2001 Saint Petersburg Mathematical Olympiad, 10.6
For any positive integers $n>m$ prove the following inequality:
$$[m,n]+[m+1,n+1]\geq 2m\sqrt{n}$$
As usual, [x,y] denotes the least common multiply of $x,y$
[I]Proposed by A. Golovanov[/i]
2014 Brazil Team Selection Test, 1
For $m$ and $n$ positive integers that are prime to each other, determine the possible values of
$$\gcd (5^m + 7^m, 5^n + 7^n)$$
2014 Saudi Arabia GMO TST, 2
Let $p \ge 2$ be a prime number and $\frac{a_p}{b_p}= 1 +\frac12+ .. +\frac{1}{p^2 -1}$, where $a_p$ and $b_p$ are two relatively prime positive integers. Compute gcd $(p, b_p)$.
2022 Kyiv City MO Round 2, Problem 4
Fedir and Mykhailo have three piles of stones: the first contains $100$ stones, the second $101$, the third $102$. They are playing a game, going in turns, Fedir makes the first move. In one move player can select any two piles of stones, let's say they have $a$ and $b$ stones left correspondently, and remove $gcd(a, b)$ stones from each of them. The player after whose move some pile becomes empty for the first time wins. Who has a winning strategy?
As a reminder, $gcd(a, b)$ denotes the greatest common divisor of $a, b$.
[i](Proposed by Oleksii Masalitin)[/i]
2022 Caucasus Mathematical Olympiad, 3
Pete wrote down $21$ pairwise distinct positive integers, each not greater than $1,000,000$. For every pair $(a, b)$ of numbers written down by Pete, Nick wrote the number
$$F(a;b)=a+b -\gcd(a;b)$$
on his piece of paper. Prove that one of Nick’s numbers differs from all of Pete’s numbers.
2009 Tournament Of Towns, 7
Initially a number $6$ is written on a blackboard. At $n$-th step an integer $k$ on the blackboard is replaced by $k+gcd(k,n)$. Prove that at each step the number on the blackboard increases either by $1$ or by a prime number.
1999 Swedish Mathematical Competition, 6
$S$ is any sequence of at least $3$ positive integers. A move is to take any $a, b$ in the sequence such that neither divides the other and replace them by gcd $(a,b)$ and lcm $(a,b)$. Show that only finitely many moves are possible and that the final result is independent of the moves made, except possibly for order.
2021 Cyprus JBMO TST, 2
Find all pairs of natural numbers $(\alpha,\beta)$ for which, if $\delta$ is the greatest common divisor of $\alpha,\beta$, and $\varDelta$ is the least common multiple of $\alpha,\beta$, then
\[ \delta + \Delta = 4(\alpha + \beta) + 2021\]
2012 Bogdan Stan, 4
Prove that the elements of any natural power of a $ 2\times 2 $ special linear integer matrix are pairwise coprime, with the possible exception of the pairs that form the diagonals.
[i]Vasile Pop[/i]
2016 Dutch Mathematical Olympiad, 3
Find all possible triples $(a, b, c)$ of positive integers with the following properties:
• $gcd(a, b) = gcd(a, c) = gcd(b, c) = 1$,
• $a$ is a divisor of $a + b + c$,
• $b$ is a divisor of $a + b + c$,
• $c$ is a divisor of $a + b + c$.
(Here $gcd(x,y)$ is the greatest common divisor of $x$ and $y$.)
2008 Thailand Mathematical Olympiad, 7
Two positive integers $m, n$ satisfy the two equations $m^2 + n^2 = 3789$ and $gcd (m, n) + lcm (m, n) = 633$. Compute $m + n$.
2015 Romania Team Selection Tests, 1
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$ .
1978 Romania Team Selection Test, 2
Suppose that $ k,l $ are natural numbers such that $ \gcd (11m-1,k)=\gcd (11m-1, l) , $ for any natural number $ m. $
Prove that there exists an integer $ n $ such that $ k=11^nl. $
2012 Dutch IMO TST, 1
For all positive integers $a$ and $b$, we de ne $a @ b = \frac{a - b}{gcd(a, b)}$ .
Show that for every integer $n > 1$, the following holds:
$n$ is a prime power if and only if for all positive integers $m$ such that $m < n$, it holds that $gcd(n, n @m) = 1$.
2018 Singapore Junior Math Olympiad, 3
One hundred balls labelled $1$ to $100$ are to be put into two identical boxes so that each box contains at least one ball and the greatest common divisor of the product of the labels of all the balls in one box and the product of the labels of all the balls in the other box is $1$. Determine the number of ways that this can be done.
2024 Czech and Slovak Olympiad III A, 1
Let $a, b, c$ be positive integers such that one of the values $$gcd(a,b) \cdot lcm(b,c), \,\,\,\, gcd(b,c)\cdot lcm(c,a), \,\,\,\, gcd(c,a)-\cdot lcm(a,b)$$
is equal to the product of the remaining two. Prove that one of the numbers $a, b, c$ is a multiple of another of them.
2019 Centers of Excellency of Suceava, 2
Let $ \left( s_n \right)_{n\ge 1 } $ be a sequence with $ s_1 $ and defined recursively as $ s_{n+1}=s_n^2-s_n+1. $
Prove that any two terms of this sequence are coprime.
[i]Dan Nedeianu[/i]
2004 Cuba MO, 4
Determine all pairs of natural numbers $ (x, y)$ for which it holds that $$x^2 = 4y + 3gcd (x, y).$$
2016 IFYM, Sozopol, 7
We are given a non-infinite sequence $a_1,a_2…a_n$ of natural numbers. While it is possible, on each turn are chosen two arbitrary indexes $i<j$ such that $a_i \nmid a_j$, and then $a_i$ and $a_j$ are changed with their $gcd$ and $lcm$. Prove that this process is non-infinite and the created sequence doesn’t depend on the made choices.
2015 Saudi Arabia BMO TST, 4
Let $n \ge 2$ be an integer and $p_1 < p_2 < ... < p_n$ prime numbers. Prove that there exists an integer $k$ relatively prime with $p_1p_2... p_n$ and such that $gcd (k + p_1p_2...p_i, p_1p_2...p_n) = 1$ for all $i = 1, 2,..., n - 1$.
Malik Talbi
2022 South Africa National Olympiad, 3
Let a, b, and c be nonzero integers. Show that there exists an integer k such that
$$gcd\left(a+kb, c\right) = gcd\left(a, b, c\right)$$
2020 LIMIT Category 2, 12
Let $A$ be the set $\{k^{19}-k: 1<k<20, k\in N\}$. Let $G$ be the GCD of all elements of $A$.
Then the value of $G$ is?
2023 Austrian MO Regional Competition, 4
Determine all pairs $(x, y)$ of positive integers such that for $d = gcd(x, y)$ the equation $$xyd = x + y + d^2$$
holds.
[i](Walther Janous)[/i]
2023 Indonesia TST, N
Given an integer $a>1$. Prove that there exists a sequence of positive integers
\[ n_1, n_2, n_3, \ldots \]
Such that
\[ \gcd(a^{n_i+1} + a^{n_i} - 1, \ a^{n_j + 1} + a^{n_j} - 1) =1 \] For every $i \neq j$.
2012 EGMO, 5
The numbers $p$ and $q$ are prime and satisfy
\[\frac{p}{{p + 1}} + \frac{{q + 1}}{q} = \frac{{2n}}{{n + 2}}\]
for some positive integer $n$. Find all possible values of $q-p$.
[i]Luxembourg (Pierre Haas)[/i]