Found problems: 51
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\]
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$.
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.
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.
2010 Czech And Slovak Olympiad III A, 6
Find the minimum of the expression $\frac{a + b + c}{2} -\frac{[a, b] + [b, c] + [c, a]}{a + b + c}$ where the variables $a, b, c$ are any integers greater than $1$ and $[x, y]$ denotes the least common multiple of numbers $x, y$.
2000 Tournament Of Towns, 3
The least common multiple of positive integers $a, b, c$ and $d$ is equal to $a + b + c + d$. Prove that $abcd$ is divisible by at least one of $3$ and $5$.
( V Senderov)
1978 Chisinau City MO, 156
The natural numbers $a_1 <a_2 <.... <a_n\le 2n$ are such that the least common multiple of any two of them is greater than $2n$. Prove that $a_1 >\left[\frac{2n}{3}\right]$.
1995 All-Russian Olympiad Regional Round, 10.2
Natural numbers $m$ and $n$ satisfy $$gcd(m,n)+lcm(m,n) = m+n. $$Prove that one of numbers $m,n$ divides the other.
1982 Kurschak Competition, 2
Prove that for any integer $k > 2$, there exist infinitely many positive integers $n$ such that the least common multiple of $n$, $n + 1$,$...$, $n + k - 1$ is greater than the least common multiple of $n + 1$,$n + 2$,$...$, $n + k$.
2018 Switzerland - Final Round, 3
Determine all natural integers $n$ for which there is no triplet $(a, b, c)$ of natural numbers such that:
$$n = \frac{a \cdot \,\,lcm(b, c) + b \cdot lcm \,\,(c, a) + c \cdot lcm \,\, (a, b)}{lcm \,\,(a, b, c)}$$
VMEO III 2006, 11.4
Given an integer $a>1$. Let $p_1 < p_2 <...< p_k$ be all prime divisors of $a$. For each positive integer $n$ we define:
$C_0(n) = a^{2n}, C_1(n) =\frac{a^{2n}}{p^2_1}, .... , C_k(n) =\frac{a^{2_n}}{p^2_k}$
$A = a^2 + 1$
$T(n) = A^{C_0(n)} - 1$
$M(n) = LCM(a^{2n+2}, A^{C_1(n)} - 1, ..., A^{C_k(n)} - 1)$
$A_n =\frac{T(n)}{M(n)}$
Prove that the sequence $A_1, A_2, ... $ satisfies the properties:
(i) Every number in the sequence is an integer greater than $1$ and has only prime divisors of the form $am + 1$.
(ii) Any two different numbers in the sequence are coprime.
2004 Estonia Team Selection Test, 5
Find all natural numbers $n$ for which the number of all positive divisors of the number lcm $(1,2,..., n)$ is equal to $2^k$ for some non-negative integer $k$.
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$.
2016 India PRMO, 15
Find the number of pairs of positive integers $(m; n)$, with $m \le n$, such that the ‘least common multiple’ (LCM) of $m$ and $n$ equals $600$.
2024 Indonesia MO, 8
Let $n \ge 2$ be a positive integer. Suppose $a_1, a_2, \dots, a_n$ are distinct integers. For $k = 1, 2, \dots, n$, let
\[ s_k := \prod_{\substack{i \not= k, \\ 1 \le i \le n}} |a_k - a_i|, \]
i.e. $s_k$ is the product of all terms of the form $|a_k - a_i|$, where $i \in \{ 1, 2, \dots, n \}$ and $i \not= k$.
Find the largest positive integer $M$ such that $M$ divides the least common multiple of $s_1, s_2, \dots, s_n$ for any choices of $a_1, a_2, \dots, a_n$.
2002 Estonia National Olympiad, 1
The greatest common divisor $d$ and the least common multiple $u$ of positive integers $m$ and $n$ satisfy the equality $3m + n = 3u + d$. Prove that $m$ is divisible by $n$.
2017 Purple Comet Problems, 4
Find the least positive integer $m$ such that $lcm(15,m) = lcm(42,m)$. Here $lcm(a, b)$ is the least common multiple of $a$ and $b$.
2000 Estonia National Olympiad, 2
The first of an infinite triangular spreadsheet the line contains one number, the second line contains two numbers, the third line contains three numbers, and so on. In doing so is in any $k$-th row ($k = 1, 2, 3,...$) in the first and last place the number $k$, each other the number in the table is found, however, than in the previous row the least common of the two numbers above it multiple (the adjacent figure shows the first five rows of this table).
We choose any two numbers from the table that are not in their row in the first or last place. Prove that one of the selected numbers is divisible by another.
[img]https://cdn.artofproblemsolving.com/attachments/3/7/107d8999d9f04777719a0f1b1df418dbe00023.png[/img]
2009 Postal Coaching, 5
For positive integers $n, k$ with $1 \le k \le n$, define $$L(n, k) = Lcm \,(n, n - 1, n -2, ..., n - k + 1)$$
Let $f(n)$ be the largest value of $k$ such that $L(n, 1) < L(n, 2) < ... < L(n, k)$.
Prove that $f(n) < 3\sqrt{n}$ and $f(n) > k$ if $n > k! + k$.
2000 Singapore Senior Math Olympiad, 3
Let $n_1,n_2,n_3,...,n_{2000}$ be $2000$ positive integers satisfying $n_1<n_2<n_3<...<n_{2000}$. Prove that
$$\frac{n_1}{[n_1,n_2]}+\frac{n_1}{[n_2,n_3]}+\frac{n_1}{[n_3,n_4]}+...+\frac{n_1}{[n_{1999},n_{2000}]} \le 1 - \frac{1}{2^{1999}}$$
where $[a, b]$ denotes the least common multiple of $a$ and $b$.
2020 Tournament Of Towns, 2
Alice had picked positive integers $a, b, c$ and then tried to find positive integers $x, y, z$ such that $a = lcm (x, y)$, $b = lcm(x, z)$, $c = lcm(y, z)$. It so happened that such $x, y, z$ existed and were unique. Alice told this fact to Bob and also told him the numbers $a$ and $b$. Prove that Bob can find $c$. (Note: lcm = least common multiple.)
Boris Frenkin
2021 Bolivian Cono Sur TST, 2
Find all posible pairs of positive integers $x,y$ such that $$\text{lcm}(x,y+3001)=\text{lcm}(y,x+3001)$$
2016 Switzerland - Final Round, 9
Let $n \ge 2$ be a natural number. For an $n$-element subset $F$ of $\{1, . . . , 2n\}$ we define $m(F)$ as the minimum of all $lcm \,\, (x, y)$ , where $x$ and $y$ are two distinct elements of $F$. Find the maximum value of $m(F)$.
2015 Czech-Polish-Slovak Junior Match, 4
Determine all such pairs pf positive integers $(a, b)$ such that $a + b + (gcd (a, b))^ 2 = lcm (a, b) = 2 \cdot lcm(a -1, b)$, where $lcm (a, b)$ denotes the smallest common multiple, and $gcd (a, b)$ denotes the greatest common divisor of numbers $a, b$.
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$.