3.1.1 GCD and LCM

How finding the Greatest Common Divisor (or GCD) is taught in classes usually involves prime factorizing the two numbers and then comparing powers of exponents. However, this is not the most efficient way of doing it during a number sense competition. One of the quickest way of doing it is by employing Euclid’s Algorithm who’s method won’t be proven here (if explanation is necessary, just Google to find the proof).

The following outlines the procedure:

  1. Arrange the numbers so that n1<n2n_1 < n_2 then find the remainder when n2n_2 is divided by n1n_1 and call it r1r_1.
  2. Now divide n1n_1 by r1r_1 and get a remainder of r2r_2.
  3. Continue the procedure until any of the remainders are 0 and the number you are dividing by is the GCD or when you notice what the GCD of any pair of numbers is.

Let’s illustrate with some examples:

Problem: GCD(36, 60) Solution: Well, when 60 is divided by 36 it leaves a remainder of 24. So, GCD(36, 60) = GCD(24, 36). Continuing the procedure, when 36 is divided by 24 it leaves a remainder of 12. So, GCD(36, 60) = GCD(24, 36) = GCD(12, 24), which from here you can tell the GCD is 12. You could also have stopped after the first step when you notice that the GCD(24, 36) is 12, and you wouldn’t have to continue the procedure.

Problem: GCD(108, 140) Solution: GCD(108, 140) → GCD(32, 108) → GCD(12, 32) → GCD(8, 12) → GCD(4, 8) = 4

If at any point in that process you notice what the GCD of the two numbers is by observation, you can cut down on the amount of steps in computation.

For computing the LCM between two numbers aa and bb, I use the formula:

LCM(a,b)=a×bGCD(a,b)\text{LCM}(a, b) = \frac{a \times b}{\text{GCD}(a, b)}

So to find what the LCM is, we must first compute the GCD. Using a prior example, let’s calculate the LCM(36, 60):

LCM(36,60)=36×6012=3×60=180\text{LCM}(36, 60) = \frac{36 \times 60}{12} = 3 \times 60 = 180

The procedure is simple enough, let’s do one more example.

Problem: Find the LCM of 44 and 84. Solution: GCD(44, 84) = GCD(40, 44) = GCD(4, 40) = 4 ⇒ LCM(44, 84) = 44×844=11×84=924\frac{44 \times 84}{4} = 11 \times 84 = 924

It should be noted that there are some questions concerning the GCD of more than two numbers (usually not ever more than three). The following outlines the procedure which should be followed:

  1. Find the GCD of two of the numbers.
  2. Find the LCM of those two numbers by using the GCD and the above formula.
  3. Calculate the GCD of the LCM of those two numbers and the third number.

It should be noted that usually one of the numbers is a multiple of another, thus leaving less required calculations (because the LCM between two numbers which are multiples of each other is just the larger of the two numbers).

The following are some more practice problems for finding GCDs and LCMs using this method:

Problem Set 3.1.1

The GCF of 35 and 63 is
The LCM of 64 and 20 is
The LCM of 27 and 36 is
The GCF of 48 and 72 is
The GCD of 27 and 36 is
The LCM of 63 and 45 is
The GCD of 132 and 156 is
The LCM of 57 and 95 is
The GCD of 52 and 91 is
The LCM of 52 and 28 is
The GCD of 48 and 54 is
The GCD of 54 and 36 is
The LCM of 27 and 36 is
The LCM of 108 and 81 is
The GCD of 28 and 52 is
The LCM of 51 and 34 is
The LCM of 23×322^3 \times 3^2 and 22×332^2 \times 3^3 is
The LCM of 28 and 42 is
The LCM of 54 and 48 is
The LCM of 84 and 70 is
The GCF of 132 and 187 is
The LCM of 48 and 72 is
The GCF of 51, 68, and 85 is
The GCF(24, 44) − LCM(24, 44) =
The LCM of 16, 20,and 32 is
The GCD(15, 28) times LCM(15, 28) is
The LCM of 12, 18,and 20 is
The LCM of 14, 21,and 42 is
The LCM of 8, 18,and 32 is
The GCD(15, 21) + LCM(15, 21) =
The GCF of 44, 66,and 88 is
The product of the GCF and LCM of 21 and 33 is
The LCM of 16, 32,and 48 is
The GCD(18, 33) + LCM(18, 33) =
The LCM of 14, 28,and 48 is
The LCM(21, 84)-GCF(21, 84) =
The LCM of 24, 36,and 48 is
The GCD(16, 20) − LCM(16, 20) =
The GCF of 42, 28,and 56 is
The product of the GCF and LCM of 24 and 30 is
The LCM of 36, 24 and 20 is
The LCM of 28, 42,and 56 is