Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
9.1. Introduction
This section
Practice test
12 questions on this section. Wrong answers show you what to read again.
Sign up to take itWhole chapter
Revision test
Mixed questions from across the chapter. Your answers get marked.
Sign up to take itQuick
Flashcard drill
3 cards from this lesson. Good the night before a test.
Try these first
- 1.
What is the GCD of 12 and 15?
Hint
List the factors of both numbers.
- 2.
State Bezout's Theorem in your own words.
Hint
Think about what a linear combination means.
- 3.
What does GCD stand for?
- Greatest Common Denominator
- Greatest Common Divisor
- General Combinatorial Division
Hint
Think about what 'divisor' means.
- 4.
True or False: Bezout's Theorem requires the integers to be positive.
- True
- False
Hint
Remember that coefficients can be negative.
- 5.
If a = 198 and b = 252, find the GCD using the Extended Euclidean Algorithm and provide the Bezout coefficients.
Hint
Follow the steps of the Extended Euclidean Algorithm carefully.
- 6.
Prove that if GCD(a, b) = 1, then a and b are coprime by applying Bezout’s theorem.
Hint
Use the definitions of gcd and linear combinations to show their relationship.
Exercises
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
4 more questions available
Enrol freeQuiz
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
2 more questions available
Enrol freeChallenge Problems
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting