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.7. Summary
This section
Practice test
11 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 does GCD stand for?
Hint
It's the largest factor that two numbers share.
- 2.
Can Bezout's coefficients be negative?
Hint
Think about combining numbers with negatives.
- 3.
What is the GCD of 8 and 12?
- 4
- 2
- 1
Hint
Think about the common factors of the numbers.
- 4.
True or False: Bezout's coefficients can only be positive.
- True
- False
Hint
Consider what integers include.
- 5.
Prove that if a number a has a multiplicative inverse mod N, then it must be coprime to N.
Hint
Think about the definitions and relationships.
- 6.
Using the extended Euclidean algorithm, compute the Bezout coefficients for 170 and 45.
Hint
Remember to express each remainder as a combination of a and b.
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
1 more question 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