Found problems: 97
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.
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$.
2013 Saudi Arabia BMO TST, 2
For positive integers $a$ and $b$, $gcd (a, b)$ denote their greatest common divisor and $lcm (a, b)$ their least common multiple. Determine the number of ordered pairs (a,b) of positive integers satisfying the equation $ab + 63 = 20\, lcm (a, b) + 12\, gcd (a,b)$
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$.
2005 Cuba MO, 7
Determine all triples of positive integers $(x, y, z)$ that satisfy
$$x < y < z, \ \ gcd(x, y) = 6, \ \ gcd(y, z) = 10, \ \ gcd(z, x) = 8 \ \ and \ \
lcm(x, y, z) = 2400.$$
2020 Macedonian Nationаl Olympiad, 1
Let $a, b$ be positive integers and $p, q$ be prime numbers for which $p \nmid q - 1$ and $q \mid a^p - b^p$. Prove that $q \mid a - b$.
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.
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}$.
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
2021 Lotfi Zadeh Olympiad, 3
Find the least possible value for the fraction
$$\frac{lcm(a,b)+lcm(b,c)+lcm(c,a)}{gcd(a,b)+gcd(b,c)+gcd(c,a)}$$
over all distinct positive integers $a, b, c$.
By $lcm(x, y)$ we mean the least common multiple of $x, y$ and by $gcd(x, y)$ we mean the greatest common divisor of $x, y$.
2017 Costa Rica - Final Round, 2
Determine the greatest common divisor of the numbers:
$$5^5-5, 7^7-7, 9^9-9 ,..., 2017^{2017}-2017,$$
2020 MMATHS, I5
For some positive integers $m>n$, the quantities $a=\text{lcm}(m,n)$ and $b=\gcd(m,n)$ satisfy $a=30b$. If $m-n$ divides $a$, then what is the value of $\frac{m+n}{b}$?
[i]Proposed by Andrew Wu[/i]
2010 NZMOC Camp Selection Problems, 4
Find all positive integer solutions $(a, b)$ to the equation $$\frac{1}{a}+\frac{1}{b}+ \frac{n}{lcm(a,b)}=\frac{1}{gcd(a, b)}$$ for
(i) $n = 2007$;
(ii) $n = 2010$.
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]
1983 Polish MO Finals, 4
Prove that if natural numbers $a,b,c,d$ satisfy the equality $ab = cd$, then $\frac{gcd(a,c)gcd(a,d)}{gcd(a,b,c,d)}= a$
2019 Saudi Arabia BMO TST, 1
Let $19$ integer numbers are given. Let Hamza writes on the paper the greatest common divisor for each pair of numbers. It occurs that the difference between the biggest and smallest numbers written on the paper is less than $180$. Prove that not all numbers on the paper are different.
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)$$
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$.
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)$$
2018 Switzerland - Final Round, 2
Let $a, b$ and $c$ be natural numbers. Determine the smallest value that the following expression can take:
$$\frac{a}{gcd\,\,(a + b, a - c)}
+
\frac{b}{gcd\,\,(b + c, b - a)}
+
\frac{c}{gcd\,\,(c + a, c - b)}.$$
.
Remark: $gcd \,\, (6, 0) = 6$ and $gcd\,\,(3, -6) = 3$.
1984 Austrian-Polish Competition, 2
Let $A$ be the set of four-digit natural numbers having exactly two distinct digits, none of which is zero. Interchanging the two digits of $n\in A$ yields a number $f (n) \in A$ (for instance, $f (3111) = 1333$). Find those $n \in A$ with $n > f (n)$ for which $gcd(n, f (n))$ is the largest possible.
2025 Alborz Mathematical Olympiad, P3
For every positive integer \( n \), do there exist pairwise distinct positive integers \( a_1, a_2, \dots, a_n \) that satisfy the following condition?
For every \( 3 \leq m \leq n \), there exists an \( i \leq m-2 \) such that:
$$
a_m = a_{\gcd(m-1, i)} + \gcd(a_{m-1}, a_i).
$$
Proposed by Alireza Jannati
2021 Durer Math Competition (First Round), 4
Determine all triples of positive integers $a, b, c$ that satisfy
a) $[a, b] + [a, c] + [b, c] = [a, b, c]$.
b) $[a, b] + [a, c] + [b, c] = [a, b, c] + (a, b, c)$.
Remark: Here $[x, y$] denotes the least common multiple of positive integers $x$ and $y$, and $(x, y)$ denotes their greatest common divisor.
2025 All-Russian Olympiad, 10.5
Let \( n \) be a natural number. The numbers \( 1, 2, \ldots, n \) are written in a row in some order. For each pair of adjacent numbers, their greatest common divisor (GCD) is calculated and written on a sheet. What is the maximum possible number of distinct values among the \( n - 1 \) GCDs obtained? \\
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\]