Greatest Common Divisor Concepts

This video tutorial explains how to find the greatest common divisor (GCD) using the Euclidean Algorithm. It covers the basics of GCD, provides examples with composite and prime numbers, and demonstrates the Euclidean Algorithm step-by-step. The tutorial includes examples of finding GCD for pairs of numbers like 12 and 33, 25 and 150, and more, using both divisors and the Euclidean method. The session concludes with a homework question for further practice.

What is the main focus of this presentation?

• Learning about divisors

• Understanding prime numbers

• Finding the GCD using the Euclidean algorithm

• Finding the LCM using the Euclidean algorithm

What is another name for the greatest common divisor?

• Lowest common multiple

• Highest common factor

• Prime factor

• Least common divisor

What are the divisors of 12?

• 1, 2, 3, 4, 6, 12

• 1, 2, 4, 8

• 1, 3, 6, 12

• 2, 4, 6, 12

What is the GCD of 12 and 33?

• 1

• 2

• 3

• 4

Which of the following is a divisor of 25?

• 1, 5, 25

• 1, 2, 5

• 5, 10, 25

• 1, 3, 25

What is the GCD of 25 and 150?

• 25

• 15

• 10

• 5

What is the GCD of two different prime numbers?

• 1

• The product of the numbers

• The sum of the numbers

• 2

What is the first step in the Euclidean algorithm?

• Subtract the smaller number from the larger

• Divide the larger number by the smaller

• Add the two numbers

• Multiply the two numbers

In the Euclidean algorithm, what do you do if the remainder is not zero?

• Stop the process

• Repeat the division with the remainder

• Add the remainder to the divisor

• Multiply the remainder by the divisor

What is the GCD of 750 and 900?

• 100

• 50

• 200

• 150