Practice Euclid’s Gcd Algorithm (8.7.3) - Prime Numbers and GCD - Discrete Mathematics

Practise this section

8 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the GCD of 24 and 36?
Show hintHide hint
Find the largest number that divides both 24 and 36.
Question 2.
Are the numbers 9 and 28 co-prime?
Show hintHide hint
Check their common divisors.
3Question 3.
What is the GCD of 15 and 10?
- 5
- 15
- 10
Show hintHide hint
List the factors of both numbers.
4Question 4.
True or False: The GCD of two numbers can be greater than either number.
- True
- False
Show hintHide hint
Think about the definition of GCD.
Question 5.
Using Euclid's algorithm, compute the GCD of 1071 and 462.
Show hintHide hint
Perform divisions of 1071 by 462 and keep finding remainders until you reach 0.
Question 6.
Prove that the GCD of a number and itself is the number.
Show hintHide hint
Consider the definition of GCD.

4 more questions in this section. Enroll free to practise them all.