Mathematics I / GCD and the Euclidean Algorithm
Practice question · Select all that apply

Select every TRUE statement about gcd and lcm for the numbers 12 and 18.

Hints
  1. Compute both, then check the two general size claims against your answers.
  2. A divisor cannot exceed the number it divides; a multiple cannot be smaller than the number it is a multiple of.
Show the answer
  • A. gcd(12, 18) = 6
  • D. The gcd is never larger than the smaller of the two numbers
  • E. The lcm is never smaller than the larger of the two numbers
  • F. lcm(12, 18) = 36
Why

gcd(12, 18) = 6 and lcm = (12 x 18)/6 = 36. The size rules follow from the definitions: a common DIVISOR is at most the smaller number, a common MULTIPLE is at least the larger. 216 is just 12 x 18, which is only the lcm when the two are coprime.

Read the lesson: GCD and the Euclidean Algorithm →

Practise GCD and the Euclidean Algorithm

The app has 6 more questions on this lesson, and keeps your place in the course. Mathematics I is free to start.

More questions on GCD and the Euclidean Algorithm