Found problems: 51
2013 Tournament of Towns, 3
Denote by $[a, b]$ the least common multiple of $a$ and $b$.
Let $n$ be a positive integer such that $[n, n + 1] > [n, n + 2] >...> [n, n + 35]$. Prove that $[n, n + 35] > [n,n + 36]$.
2022 Kyiv City MO Round 2, Problem 1
a) Do there exist positive integers $a$ and $d$ such that $[a, a+d] = [a, a+2d]$?
b) Do there exist positive integers $a$ and $d$ such that $[a, a+d] = [a, a+4d]$?
Here $[a, b]$ denotes the least common multiple of integers $a, b$.
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$.
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
1998 Tournament Of Towns, 1
(a) Prove that for any two positive integers a and b the equation $lcm (a, a + 5) = lcm (b, b + 5)$ implies $a = b$.
(b) Is it possible that $lcm (a, b) = lcm (a + c, b + c)$ for positive integers $a, b$ and $c$?
(A Shapovalov)
PS. part (a) for Juniors, both part for Seniors
2004 Estonia National Olympiad, 1
Find all triples of positive integers $(x, y, z)$ satisfying $x < y < z$, $gcd(x, y) = 6, gcd(y, z) = 10, gcd(z, x) = 8$ and $lcm(x, y,z) = 2400$.
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$.
2013 Switzerland - Final Round, 1
Find all triples $(a, b, c)$ of natural numbers such that the sets
$$\{ gcd (a, b), gcd(b, c), gcd(c, a), lcm (a, b), lcm (b, c), lcm (c, a)\}$$ and
$$\{2, 3, 5, 30, 60\}$$
are the same.
Remark: For example, the sets $\{1, 2013\}$ and $\{1, 1, 2013\}$ are equal.
2019 Caucasus Mathematical Olympiad, 2
Determine if there exist five consecutive positive integers such that their LCM is a perfect square.
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.
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$.
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$.
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 Bogdan Stan, 2
For any $ a\in\mathbb{Z}_{\ge 0} $ make the notation $ a\mathbb{Z}_{\ge 0} =\{ an| n\in\mathbb{Z}_{\ge 0} \} . $ Prove that the following relations are equivalent:
$ \text{(1)} a\mathbb{Z}_{\ge 0} \setminus b\mathbb{Z}_{\ge 0}\subset c\mathbb{Z}_{\ge 0} \setminus d\mathbb{Z}_{\ge 0} $
$ \text{(2)} b|a\text{ or } (c|a\text{ and } \text{lcm} (a,b) |\text{lcm} (a,d)) $
[i]Marin Tolosi[/i] and [i]Cosmin Nitu[/i]
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]
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.
2021 Czech-Polish-Slovak Junior Match, 3
Find the number of pairs $(a, b)$ of positive integers with the property that the greatest common divisor of $a$ and $ b$ is equal to $1\cdot 2 \cdot 3\cdot ... \cdot50$, and the least common multiple of $a$ and $ b$ is $1^2 \cdot 2^2 \cdot 3^2\cdot ... \cdot 50^2$.
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 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.
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$.
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)
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$.
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)$$
2008 Postal Coaching, 1
Prove that for any $n \ge 1$,
$LCM _{0\le k\le n} \big \{$ $n \choose k$ $\big\} = \frac{1}{n + 1} LCM \{1, 2,3,...,n + 1\}$
2022 JBMO Shortlist, N2
Let $a < b < c < d < e$ be positive integers. Prove that
$$\frac{1}{[a, b]} + \frac{1}{[b, c]} + \frac{1}{[c, d]} + \frac{2}{[d, e]} \le 1$$
where $[x, y]$ is the least common multiple of $x$ and $y$ (e.g., $[6, 10] = 30$). When does equality hold?