Olympiad problems

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\}$

2014 Contests, 3

Tags: greatest common divisor , least common multiple , inequalities , number theory

Let $a,b$ be natural numbers with $ab>2$. Suppose that the sum of their greatest common divisor and least common multiple is divisble by $a+b$. Prove that the quotient is at most $\frac{a+b}{4}$. When is this quotient exactly equal to $\frac{a+b}{4}$

2003 Germany Team Selection Test, 3

Tags: floor function , inequalities , least common multiple , ceiling function , number theory

Let $N$ be a natural number and $x_1, \ldots , x_n$ further natural numbers less than $N$ and such that the least common multiple of any two of these $n$ numbers is greater than $N$. Prove that the sum of the reciprocals of these $n$ numbers is always less than $2$: $\sum^n_{i=1} \frac{1}{x_i} < 2.$

2013 AMC 8, 10

Tags: number theory , greatest common divisor , ratio , least common multiple

What is the ratio of the least common multiple of 180 and 594 to the greatest common factor of 180 and 594? $\textbf{(A)}\ 110 \qquad \textbf{(B)}\ 165 \qquad \textbf{(C)}\ 330 \qquad \textbf{(D)}\ 625 \qquad \textbf{(E)}\ 660$

2015 Mathematical Talent Reward Programme, SAQ: P 5

Tags: number theory , least common multiple , greatest common divisor

Let $a$ be the smallest and $A$ the largest of $n$ distinct positive integers. Prove that the least common multiple of these numbers is greater than or equal to $n a$ and that the greatest common divisor is less than or equal to $\frac{A}{n}$

1997 Iran MO (3rd Round), 3

Tags: analytic geometry , number theory , least common multiple , combinatorics

Let $d$ be a real number such that $d^2=r^2+s^2$, where $r$ and $s$ are rational numbers. Prove that we can color all points of the plane with rational coordinates with two different colors such that the points with distance $d$ have different colors.

2012 JBMO TST - Turkey, 1

Tags: geometry , 3d geometry , least common multiple , number theory

Find the greatest positive integer $n$ for which $n$ is divisible by all positive integers whose cube is not greater than $n.$

2014 JHMMC 7 Contest, 10

Tags: greatest common divisor , number theory , least common multiple

Find the sum of the greatest common factor and the least common multiple of $12$ and $18$.

2006 Iran MO (2nd round), 3

Tags: induction , least common multiple , combinatorics

Some books are placed on each other. Someone first, reverses the upper book. Then he reverses the $2$ upper books. Then he reverses the $3$ upper books and continues like this. After he reversed all the books, he starts this operation from the first. Prove that after finite number of movements, the books become exactly like their initial configuration.

2016 Dutch IMO TST, 3

Tags: number theory , least common multiple

Find all positive integers $k$ for which the equation: $$ \text{lcm}(m,n)-\text{gcd}(m,n)=k(m-n)$$ has no solution in integers positive $(m,n)$ with $m\neq n$.

PEN H Problems, 86

Tags: diophantine equation , geometry , function , euler , least common multiple

A triangle with integer sides is called Heronian if its area is an integer. Does there exist a Heronian triangle whose sides are the arithmetic, geometric and harmonic means of two positive integers?

2007 Junior Balkan Team Selection Tests - Romania, 4

Tags: least common multiple , number theory

Find all integer positive numbers $n$ such that: $n=[a,b]+[b,c]+[c,a]$, where $a,b,c$ are integer positive numbers and $[p,q]$ represents the least common multiple of numbers $p,q$.

2015 Junior Balkan Team Selection Tests - Moldova, 8

Tags: least common multiple , lcm , number theory

Determine the number of all ordered triplets of positive integers $(a, b, c)$, which satisfy the equalities: $$[a, b] =1000, [b, c] = 2000, [c, a] =2000.$$ ([x, y]represents the least common multiple of positive integers x,y)

2015 Romania Team Selection Tests, 3

Tags: least common multiple , function , number theory , rip

If $k$ and $n$ are positive integers , and $k \leq n$ , let $M(n,k)$ denote the least common multiple of the numbers $n , n-1 , \ldots , n-k+1$.Let $f(n)$ be the largest positive integer $ k \leq n$ such that $M(n,1)<M(n,2)<\ldots <M(n,k)$ . Prove that : [b](a)[/b] $f(n)<3\sqrt{n}$ for all positive integers $n$ . [b](b)[/b] If $N$ is a positive integer , then $f(n) > N$ for all but finitely many positive integers $n$.

1998 Dutch Mathematical Olympiad, 3

Tags: least common multiple

Let $m$ and $n$ be positive integers such that $m - n = 189$ and such that the least common multiple of $m$ and $n$ is equal to $133866$. Find $m$ and $n$.

2025 Romania EGMO TST, P4

Tags: binomial coefficient , number theory , least common multiple

How does one show $$\text{lcm}\left(\binom{n}{1},\binom{n}{2},\ldots,\binom{n}{n}\right)=\frac{\text{lcm}(1,2,\ldots,n+1)}{n+1}$$

PEN A Problems, 15

Tags: number theory , least common multiple , divisibility theory

Suppose that $k \ge 2$ and $n_{1}, n_{2}, \cdots, n_{k}\ge 1$ be natural numbers having the property \[n_{2}\; \vert \; 2^{n_{1}}-1, n_{3}\; \vert \; 2^{n_{2}}-1, \cdots, n_{k}\; \vert \; 2^{n_{k-1}}-1, n_{1}\; \vert \; 2^{n_{k}}-1.\] Show that $n_{1}=n_{2}=\cdots=n_{k}=1$.

2009 Romanian Masters In Mathematics, 1

Tags: floor function , inequalities , number theory , greatest common divisor , least common multiple , triangle inequality , algebra

For $ a_i \in \mathbb{Z}^ \plus{}$, $ i \equal{} 1, \ldots, k$, and $ n \equal{} \sum^k_{i \equal{} 1} a_i$, let $ d \equal{} \gcd(a_1, \ldots, a_k)$ denote the greatest common divisor of $ a_1, \ldots, a_k$. Prove that $ \frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i \equal{} 1} (a_i!)}$ is an integer. [i]Dan Schwarz, Romania[/i]

1988 AIME Problems, 8

Tags: function , number theory , least common multiple , algorithm , euclidean algorithm

The function $f$, defined on the set of ordered pairs of positive integers, satisfies the following properties: \begin{eqnarray*} f(x,x) &=& x, \\ f(x,y) &=& f(y,x), \quad \text{and} \\ (x + y) f(x,y) &=& yf(x,x + y). \end{eqnarray*} Calculate $f(14,52)$.

2024 Olimphíada, 1

Tags: number theory , least common multiple , factorial

Find all pairs of positive integers $(m,n)$ such that $$lcm(1,2,\dots,n)=m!$$ where $lcm(1,2,\dots,n)$ is the smallest positive integer multiple of all $1,2,\dots n-1$ and $n$.

2004 Iran MO (3rd Round), 18

Tags: least common multiple , number theory

Prove that for any $ n$, there is a subset $ \{a_1,\dots,a_n\}$ of $ \mathbb N$ such that for each subset $ S$ of $ \{1,\dots,n\}$, $ \sum_{i\in S}a_i$ has the same set of prime divisors.

2012 Greece JBMO TST, 2

Tags: number theory , least common multiple , coprime , diophantine equation

Find all pairs of coprime positive integers $(p,q)$ such that $p^2+2q^2+334=[p^2,q^2]$ where $[p^2,q^2]$ is the leact common multiple of $p^2,q^2$ .

2014 Middle European Mathematical Olympiad, 7

Tags: least common multiple , number theory

A finite set of positive integers $A$ is called [i]meanly[/i] if for each of its nonempy subsets the arithmetic mean of its elements is also a positive integer. In other words, $A$ is meanly if $\frac{1}{k}(a_1 + \dots + a_k)$ is an integer whenever $k \ge 1$ and $a_1, \dots, a_k \in A$ are distinct. Given a positive integer $n$, determine the least possible sum of the elements of a meanly $n$-element set.

2014 District Olympiad, 4

Tags: number theory , least common multiple , geometry

Let $ABCD$ be a square and consider the points $K\in AB, L\in BC,$ and $M\in CD$ such that $\Delta KLM$ is a right isosceles triangle, with the right angle at $L$. Prove that the lines $AL$ and $DK$ are perpendicular to each other.

2006 Iran Team Selection Test, 1

Tags: least common multiple , function , number theory

Suppose that $p$ is a prime number. Find all natural numbers $n$ such that $p|\varphi(n)$ and for all $a$ such that $(a,n)=1$ we have \[ n|a^{\frac{\varphi(n)}{p}}-1 \]