Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
What does Bezout's Theorem state?
Think about relationships between two integers.
Define the term GCD.
Consider what it means to evenly divide a number.
What is the main assertion of Bezout's Theorem?
Think about how GCD relates to linear equations.
True or False: The Extended Euclidean Algorithm finds the GCD and integer coefficients.
Consider the main functions of the Extended Euclidean Algorithm.
Use integers a = 84 and b = 30. Find the GCD using both the Euclidean and Extended Euclidean methods, providing s and t.
Iterate through finding remainders until you reach zero.
Suppose a and b are both even integers. Prove that their GCD is even using the principles from Bezout’s Theorem.
Consider the implications of linear combinations in your proof.
5 more questions in this section. Enroll free to practise them all.
Enroll free