Found problems: 97
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]
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$.
2019 Dutch IMO TST, 3
Let $n$ be a positive integer. Determine the maximum value of $gcd(a, b) + gcd(b, c) + gcd(c, a)$ for positive integers $a, b, c$ such that $a + b + c = 5n$.
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]
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
2004 Switzerland - Final Round, 8
A list of natural numbers is written on a blackboard. The following operation is performed and repeated: choose any two numbers $a, b$, wipe them out and instead write gcd$(a, b)$ and lcm$(a, b)$. Show that the content of the list no longer changed after a certain point in time.
2024 USEMO, 1
There are $1001$ stacks of coins $S_1, S_2, \dots, S_{1001}$. Initially, stack $S_k$ has $k$ coins for each $k = 1,2,\dots,1001$. In an operation, one selects an ordered pair $(i,j)$ of indices $i$ and $j$ satisfying $1 \le i < j \le 1001$ subject to two conditions:
[list]
[*]The stacks $S_i$ and $S_j$ must each have at least $1$ coin.
[*]The ordered pair $(i,j)$ must [i]not[/i] have been selected before.
[/list]
Then, if $S_i$ and $S_j$ have $a$ coins and $b$ coins respectively, one removes $\gcd(a,b)$ coins from each stack.
What is the maximum number of times this operation could be performed?
[i]Galin Totev[/i]
2025 Kosovo National Mathematical Olympiad`, P4
Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ for which these two conditions hold simultaneously
(i) For all $m,n \in \mathbb{N}$ we have:
$$ \frac{f(mn)}{\gcd(m,n)} = \frac{f(m)f(n)}{f(\gcd(m,n))};$$
(ii) For all prime numbers $p$, there exists a prime number $q$ such that $f(p^{2025})=q^{2025}$.
1982 Austrian-Polish Competition, 1
Find all pairs $(n, m)$ of positive integers such that $gcd ((n + 1)^m - n, (n + 1)^{m+3} - n) > 1$.
2018 Turkey Team Selection Test, 7
For integers $a, b$, call the lattice point with coordinates $(a,b)$ [b]basic[/b] if $gcd(a,b)=1$. A graph takes the basic points as vertices and the edges are drawn in such way: There is an edge between $(a_1,b_1)$ and $(a_2,b_2)$ if and only if $2a_1=2a_2\in \{b_1-b_2, b_2-b_1\}$ or $2b_1=2b_2\in\{a_1-a_2, a_2-a_1\}$. Some of the edges will be erased, such that the remaining graph is a forest. At least how many edges must be erased to obtain this forest? At least how many trees exist in such a forest?
2010 China Northern MO, 7
Find all positive integers $x, y, z$ that satisfy the conditions: $$[x,y,z] =(x,y)+(y,z) + (z,x), x\le y\le z, (x,y,z) = 1$$
The symbols $[m,n]$ and $(m,n)$ respectively represent positive integers, the least common multiple and the greatest common divisor of $m$ and $n$.
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]
2022 South East Mathematical Olympiad, 5
Positive sequences $\{a_n\},\{b_n\}$ satisfy:$a_1=b_1=1,b_n=a_nb_{n-1}-\frac{1}{4}(n\geq 2)$.
Find the minimum value of $4\sqrt{b_1b_2\cdots b_m}+\sum_{k=1}^m\frac{1}{a_1a_2\cdots a_k}$,where $m$ is a given positive integer.
2001 Saint Petersburg Mathematical Olympiad, 9.4
Let $a,b,c\in\mathbb{Z^{+}}$ such that
$$(a^2-1, b^2-1, c^2-1)=1$$
Prove that
$$(ab+c, bc+a, ca+b)=(a,b,c)$$
(As usual, $(x,y,z)$ means the greatest common divisor of numbers $x,y,z$)
[I]Proposed by A. Golovanov[/i]
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.
2019 Nigerian Senior MO Round 3, 3
Show that $$5^{2019} \mid \Sigma^{5^{2019}}_{k=1}3^{gcd (5^{2019},k)}$$
2011 Saudi Arabia IMO TST, 2
Consider the set $S= \{(a + b)^7 - a^7 - b^7 : a,b \in Z\}$. Find the greatest common divisor of all members in $S$.
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)$$
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)$.
2012 Thailand Mathematical Olympiad, 7
Let $a, b, m$ be integers such that gcd $(a, b) = 1$ and $5 | ma^2 + b^2$ . Show that there exists an integer $n$ such that $5 | m - n^2$.
2004 Thailand Mathematical Olympiad, 14
Compute gcd$(5^{2547} - 1, 5^{2004} - 1)$.
2008 Indonesia TST, 3
Let $n$ be an arbitrary positive integer.
(a) For every positive integers $a$ and $b$, show that $gcd(n^a + 1, n^b + 1) \le n^{gcd(a,b)} + 1$.
(b) Show that there exist infinitely many composite pairs ($a, b)$, such that each of them is not a multiply of the other number and equality holds in (a).