Skip to content

GCD and LCM: all problems

Focus mode: every practice problem from the chapter, one after another.

0 / 9 solved

Problem 19.5.1

AMC 10

Each piece of candy in a store costs a whole number of cents. Casper has exactly enough money to buy either 12 pieces of red candy, 14 pieces of green candy, 15 pieces of blue candy, or nn pieces of purple candy. A piece of purple candy costs 20 cents. What is the smallest possible value of nn?

Problem 19.5.2

AMC 8

The least common multiple of aa and bb is 12, and the least common multiple of bb and cc is 15. What is the least possible value of the least common multiple of aa and cc?

Problem 19.5.3

AIME

For how many values of kk is 121212^{12} the least common multiple of the positive integers 666^6, 888^8, and kk?

Problem 19.5.4

AMC 10

Let a,b,c,a, b, c, and dd be positive integers such that gcd⁡(a,b)=24\gcd(a, b) = 24, gcd⁡(b,c)=36\gcd(b, c) = 36, gcd⁡(c,d)=54\gcd(c, d) = 54, and 70<gcd⁡(d,a)<10070 < \gcd(d, a) < 100. Which of the following must be a divisor of aa?

(Choices from the original contest: 5, 7, 11, 13, 17.)

Problem 19.5.5(additional)

Omega Learn

If the GCD of 2 numbers is 12 and the LCM of the same 2 numbers is 240, find the product of the numbers.

Problem 19.5.6(additional)

Omega Learn

Two numbers aa and bb satisfy the condition lcm⁡(gcd⁡(24,a),gcd⁡(a,b))=lcm⁡(gcd⁡(24,b),gcd⁡(a,b))\operatorname{lcm}(\gcd(24, a), \gcd(a, b)) = \operatorname{lcm}(\gcd(24, b), \gcd(a, b)). If a=2ba = 2b, what is the smallest possible value of a+ba + b?

Problem 19.5.7(additional)

AIME

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

Problem 19.5.8(additional)

Omega Learn

Three numbers aa, bb, and cc satisfy the conditions that gcd⁡(a,b)=20\gcd(a, b) = 20, gcd⁡(b,c)=18\gcd(b, c) = 18, and lcm⁡(a,c)=5040\operatorname{lcm}(a, c) = 5040. Find the sum of all possible values of a+ca + c.

Problem 19.5.9(additional)

AMC 10

Let nn be the least positive integer greater than 1000 for which

gcd⁡(63,n+120)=21andgcd⁡(n+63,120)=60.\gcd(63, n + 120) = 21 \quad\text{and}\quad \gcd(n + 63, 120) = 60.

What is the sum of the digits of nn?