Olympiad problems

2006 AIME Problems, 14

Let $S_n$ be the sum of the reciprocals of the non-zero digits of the integers from 1 to $10^n$ inclusive. Find the smallest positive integer $n$ for which $S_n$ is an integer.

2007 Singapore Junior Math Olympiad, 4

Tags: number theory , greatest common divisor , least common multiple , sum , difference , product

The difference between the product and the sum of two different integers is equal to the sum of their GCD (greatest common divisor) and LCM (least common multiple). Findall these pairs of numbers. Justify your answer.

1980 Putnam, A2

Tags: least common multiple , elementary-number-theory

Let $r$ and $s$ be positive integers. Derive a formula for the number of ordered quadruples $(a,b,c,d)$ of positive integers such that $$3^r \cdot 7^s = \text{lcm}(a,b,c)= \text{lcm}(a,b,d)=\text{lcm}(a,c,d)=\text{lcm}(b,c,d),$$ depending only on $r$ and $s.$

1994 All-Russian Olympiad, 5

Tags: number theory , least common multiple , inequality

Prove that, for any natural numbers $k,m,n$: $[k,m] \cdot [m,n] \cdot [n,k] \ge [k,m,n]^2$

2010 Purple Comet Problems, 3

Tags: number theory , least common multiple , relatively prime

The sum $\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}=\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

1998 AIME Problems, 1

Tags: least common multiple , number theory

For how many values of $k$ is $12^{12}$ the least common multiple of the positive integers $6^6, 8^8,$ and $k$?

2010 AMC 12/AHSME, 21

Tags: number theory , polynomial , algebra , least common multiple , binomial theorem , floor function

Let $ a>0$, and let $ P(x)$ be a polynomial with integer coefficients such that \[ P(1)\equal{}P(3)\equal{}P(5)\equal{}P(7)\equal{}a\text{, and}\] \[ P(2)\equal{}P(4)\equal{}P(6)\equal{}P(8)\equal{}\minus{}a\text{.}\] What is the smallest possible value of $ a$? $ \textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$

2011 Danube Mathematical Competition, 2

Tags: number theory , least common multiple

Let S be a set of positive integers such that: min { lcm (x, y) : x, y ∈ S, $x \neq y$ } $\ge$ 2 + max S. Prove that $\displaystyle\sum\limits_{x \in S} \frac{1}{x} \le \frac{3}{2} $.

1974 IMO Longlists, 24

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

Let $a_i, b_i$ be coprime positive integers for $i = 1, 2, \ldots , k$, and $m$ the least common multiple of $b_1, \ldots , b_k$. Prove that the greatest common divisor of $a_1 \frac{m}{b_1} , \ldots, a_k \frac{m}{b_k}$ equals the greatest common divisor of $a_1, \ldots , a_k.$

2009 Romanian Master of Mathematics, 1

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

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]

2014 JHMMC 7 Contest, 10

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

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

2011 Kyiv Mathematical Festival, 1

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

Solve the equation $m^{gcd(m,n)} = n^{lcm(m,n)}$ in positive integers, where gcd($m, n$) – greatest common divisor of $m,n$, and lcm($m, n$) – least common multiple of $m,n$.

2015 Iran Team Selection Test, 2

Tags: least common multiple , number theory

Assume that $a_1, a_2, a_3$ are three given positive integers consider the following sequence: $a_{n+1}=\text{lcm}[a_n, a_{n-1}]-\text{lcm}[a_{n-1}, a_{n-2}]$ for $n\ge 3$ Prove that there exist a positive integer $k$ such that $k\le a_3+4$ and $a_k\le 0$. ($[a, b]$ means the least positive integer such that$ a\mid[a,b], b\mid[a, b]$ also because $\text{lcm}[a, b]$ takes only nonzero integers this sequence is defined until we find a zero number in the sequence)

2019 Durer Math Competition Finals, 11

Tags: number theory , least common multiple , lcm

What is the smallest possible value of the least common multiple of $a, b, c, d$ if we know that these four numbers are distinct and $a + b + c + d = 1000$?

2012 Indonesia TST, 1

Tags: least common multiple , algebra , polynomial , number theory

Given a positive integer $n$. (a) If $P$ is a polynomial of degree $n$ where $P(x) \in \mathbb{Z}$ for every $x \in \mathbb{Z}$, prove that for every $a,b \in \mathbb{Z}$ where $P(a) \neq P(b)$, \[\text{lcm}(1, 2, \ldots, n) \ge \left| \dfrac{a-b}{P(a) - P(b)} \right|\] (b) Find one $P$ (for each $n$) such that the equality case above is achieved for some $a,b \in \mathbb{Z}$.

2002 National Olympiad First Round, 6

Tags: least common multiple , modular arithmetic

The thousands digit of a five-digit number which is divisible by $37$ and $173$ is $3$. What is the hundreds digit of this number? $ \textbf{a)}\ 0 \qquad\textbf{b)}\ 2 \qquad\textbf{c)}\ 4 \qquad\textbf{d)}\ 6 \qquad\textbf{e)}\ 8 $

2004 AMC 8, 19

Tags: number theory , least common multiple

A whole number larger than $2$ leaves a remainder of $2$ when divided by each of the numbers $3, 4, 5$ and $6$. The smallest such number lies between which two numbers? $\textbf{(A)}\ 40\text{ and }49\qquad \textbf{(B)}\ 60\text{ and }79\qquad \textbf{(C)}\ 100\text{ and }129\qquad \textbf{(D)}\ 210\text{ and }249\qquad \textbf{(E)}\ 320\text{ and }369$

2007 China Team Selection Test, 3

Tags: number theory , least common multiple , relatively prime

Let $ n$ be a positive integer, let $ A$ be a subset of $ \{1, 2, \cdots, n\}$, satisfying for any two numbers $ x, y\in A$, the least common multiple of $ x$, $ y$ not more than $ n$. Show that $ |A|\leq 1.9\sqrt {n} \plus{} 5$.

2006 AMC 8, 16

Tags: least common multiple , ratio , number theory

Problems 14, 15 and 16 involve Mrs. Reed's English assignment. A Novel Assignment The students in Mrs. Reed's English class are reading the same 760-page novel. Three friends, Alice, Bob and Chandra, are in the class. Alice reads a page in 20 seconds, Bob reads a page in 45 seconds and Chandra reads a page in 30 seconds. Before Chandra and Bob start reading, Alice says she would like to team read with them. If they divide the book into three sections so that each reads for the same length of time, how many seconds will each have to read? $ \textbf{(A)}\ 6400 \qquad \textbf{(B)}\ 6600 \qquad \textbf{(C)}\ 6800 \qquad \textbf{(D)}\ 7000 \qquad \textbf{(E)}\ 7200$

1987 AIME Problems, 7

Tags: least common multiple , symmetry , number theory

Let $[r,s]$ denote the least common multiple of positive integers $r$ and $s$. Find the number of ordered triples $(a,b,c)$ of positive integers for which $[a,b] = 1000$, $[b,c] = 2000$, and $[c,a] = 2000$

2025 Romania EGMO TST, P4

Tags: least common multiple , number theory , binomial coefficient

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

2020 China Team Selection Test, 3

Tags: least common multiple , algebra , number theory

For a non-empty finite set $A$ of positive integers, let $\text{lcm}(A)$ denote the least common multiple of elements in $A$, and let $d(A)$ denote the number of prime factors of $\text{lcm}(A)$ (counting multiplicity). Given a finite set $S$ of positive integers, and $$f_S(x)=\sum_{\emptyset \neq A \subset S} \frac{(-1)^{|A|} x^{d(A)}}{\text{lcm}(A)}.$$ Prove that, if $0 \le x \le 2$, then $-1 \le f_S(x) \le 0$.

2015 Romania Team Selection Tests, 3

Tags: function , number theory , least common multiple , 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$.

1999 Swedish Mathematical Competition, 6

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

$S$ is any sequence of at least $3$ positive integers. A move is to take any $a, b$ in the sequence such that neither divides the other and replace them by gcd $(a,b)$ and lcm $(a,b)$. Show that only finitely many moves are possible and that the final result is independent of the moves made, except possibly for order.

2016 Dutch IMO TST, 3

Tags: least common multiple , number theory

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$.