Olympiad problems

2012 Canada National Olympiad, 2

For any positive integers $n$ and $k$, let $L(n,k)$ be the least common multiple of the $k$ consecutive integers $n,n+1,\ldots ,n+k-1$. Show that for any integer $b$, there exist integers $n$ and $k$ such that $L(n,k)>bL(n+1,k)$.

2008 ISI B.Stat Entrance Exam, 9

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

Suppose $S$ is the set of all positive integers. For $a,b \in S$, define \[a * b=\frac{\text{lcm}[a,b]}{\text{gcd}(a,b)}\] For example $8*12=6$. Show that [b]exactly two[/b] of the following three properties are satisfied: (i) If $a,b \in S$, then $a*b \in S$. (ii) $(a*b)*c=a*(b*c)$ for all $a,b,c \in S$. (iii) There exists an element $i \in S$ such that $a *i =a$ for all $a \in S$.

2011 Purple Comet Problems, 11

Tags: number theory , least common multiple , arithmetic sequence

How many numbers are there that appear both in the arithmetic sequence $10, 16, 22, 28, ... 1000$ and the arithmetic sequence $10, 21, 32, 43, ..., 1000?$

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.

2011 Iran Team Selection Test, 2

Tags: least common multiple , arithmetic sequence , number theory

Find all natural numbers $n$ greater than $2$ such that there exist $n$ natural numbers $a_{1},a_{2},\ldots,a_{n}$ such that they are not all equal, and the sequence $a_{1}a_{2},a_{2}a_{3},\ldots,a_{n}a_{1}$ forms an arithmetic progression with nonzero common difference.

2012 Indonesia TST, 1

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

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

2007 AIME Problems, 8

Tags: polynomial , quadratic , number theory , greatest common divisor , algorithm , least common multiple , algebra

The polynomial $P(x)$ is cubic. What is the largest value of $k$ for which the polynomials $Q_{1}(x) = x^{2}+(k-29)x-k$ and $Q_{2}(x) = 2x^{2}+(2k-43)x+k$ are both factors of $P(x)$?

2012 Math Prize For Girls Problems, 6

Tags: least common multiple

For how many ordered pairs of positive integers $(x, y)$ is the least common multiple of $x$ and $y$ equal to $1{,}003{,}003{,}001$?

2007 Tournament Of Towns, 2

Tags: greatest common divisor , least common multiple , combinatorics

[b](a)[/b] Each of Peter and Basil thinks of three positive integers. For each pair of his numbers, Peter writes down the greatest common divisor of the two numbers. For each pair of his numbers, Basil writes down the least common multiple of the two numbers. If both Peter and Basil write down the same three numbers, prove that these three numbers are equal to each other. [b](b)[/b] Can the analogous result be proved if each of Peter and Basil thinks of four positive integers instead?

2024 Taiwan Mathematics Olympiad, 2

Tags: number theory , least common multiple

A positive integer is [b]superb[/b] if it is the least common multiple of $1,2,\ldots, n$ for some positive integer $n$. Find all superb $x,y,z$ such that $x+y=z$. [i] Proposed by usjl[/i]

2016 AMC 10, 25

Tags: number theory , least common multiple

How many ordered triples $(x,y,z)$ of positive integers satisfy $\text{lcm}(x,y) = 72, \text{lcm}(x,z) = 600$ and $\text{lcm}(y,z)=900$? $\textbf{(A)}\ 15\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 27\qquad\textbf{(E)}\ 64$

2002 National Olympiad First Round, 6

Tags: modular arithmetic , least common multiple

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 $

1996 Baltic Way, 8

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

Consider the sequence: $x_1=19,x_2=95,x_{n+2}=\text{lcm} (x_{n+1},x_n)+x_n$, for $n>1$, where $\text{lcm} (a,b)$ means the least common multiple of $a$ and $b$. Find the greatest common divisor of $x_{1995}$ and $x_{1996}$.

2010 AMC 12/AHSME, 21

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

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

2023 South Africa National Olympiad, 3

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

Consider $2$ positive integers $a,b$ such that $a+2b=2020$. (a) Determine the largest possible value of the greatest common divisor of $a$ and $b$. (b) Determine the smallest possible value of the least common multiple of $a$ and $b$.

2014 NZMOC Camp Selection Problems, 6

Tags: least common multiple , lcm , number theory

Determine all triples of positive integers $a$, $ b$ and $c$ such that their least common multiple is equal to their sum.

2014 Online Math Open Problems, 6

Tags: modular arithmetic , least common multiple

Let $L_n$ be the least common multiple of the integers $1,2,\dots,n$. For example, $L_{10} = 2{,}520$ and $L_{30} = 2{,}329{,}089{,}562{,}800$. Find the remainder when $L_{31}$ is divided by $100{,}000$. [i]Proposed by Evan Chen[/i]

2000 Manhattan Mathematical Olympiad, 2

Tags: modular arithmetic , least common multiple , number theory

How many zeroes are there at the end the number $9^{999} + 1$?

2019 Iran RMM TST, 4

Tags: number theory , least common multiple

Let $a,b $ be two relatively prime positive integers.Also let $m,n $ be positive integers with $n> m $.\\ Prove that\\ $lcm [am+b,a (m+1)+b,...,an+b]\ge (n+1)\cdot \binom {n}{m}$ [i]Proposed by Navid Safaei[/i]

2007 Korea Junior Math Olympiad, 2

Tags: number theory , coprime , least common multiple , positive integer

If $n$ is a positive integer and $a, b$ are relatively prime positive integers, calculate $(a + b,a^n + b^n)$.

2012 Poland - Second Round, 3

Tags: least common multiple , vector , absolute value , number theory

Let $m,n\in\mathbb{Z_{+}}$ be such numbers that set $\{1,2,\ldots,n\}$ contains exactly $m$ different prime numbers. Prove that if we choose any $m+1$ different numbers from $\{1,2,\ldots,n\}$ then we can find number from $m+1$ choosen numbers, which divide product of other $m$ numbers.

2014 South africa National Olympiad, 4

Tags: function , least common multiple , number theory

(a) Let $a,x,y$ be positive integers. Prove: if $x\ne y$, the also \[ax+\gcd(a,x)+\text{lcm}(a,x)\ne ay+\gcd(a,y)+\text{lcm}(a,y).\] (b) Show that there are no two positive integers $a$ and $b$ such that \[ab+\gcd(a,b)+\text{lcm}(a,b)=2014.\]

2019 CCA Math Bonanza, I4

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

How many ordered pairs $\left(a,b\right)$ of positive integers are there such that \[\gcd\left(a,b\right)^3=\mathrm{lcm}\left(a,b\right)^2=4^6\] is true? [i]2019 CCA Math Bonanza Individual Round #4[/i]

1958 AMC 12/AHSME, 32

Tags: modular arithmetic , least common multiple , number theory , diophantine equation

With $ \$1000$ a rancher is to buy steers at $ \$25$ each and cows at $ \$26$ each. If the number of steers $ s$ and the number of cows $ c$ are both positive integers, then: $ \textbf{(A)}\ \text{this problem has no solution}\qquad\\ \textbf{(B)}\ \text{there are two solutions with }{s}\text{ exceeding }{c}\qquad \\ \textbf{(C)}\ \text{there are two solutions with }{c}\text{ exceeding }{s}\qquad \\ \textbf{(D)}\ \text{there is one solution with }{s}\text{ exceeding }{c}\qquad \\ \textbf{(E)}\ \text{there is one solution with }{c}\text{ exceeding }{s}$

2020 Princeton University Math Competition, 3

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

Alice and Bob are playing a guessing game. Bob is thinking of a number n of the form $2^a3^b$, where a and b are positive integers between $ 1$ and $2020$, inclusive. Each turn, Alice guess a number m, and Bob will tell her either $\gcd (m, n)$ or $lcm (m, n)$ (letting her know that he is saying that $gcd$ or $lcm$), as well as whether any of the respective powers match up in their prime factorization. In particular, if $m = n$, Bob will let Alice know this, and the game is over. Determine the smallest number $k$ so that Alice is always able to find $n$ within $k$ guesses, regardless of Bob’s number or choice of revealing either the $lcm$, or the $gcd$ .