Question: Use the extended Euclidean algorithm to find the greatest common divisor of 7 , 0 3 8 and 7 2 0 and express it as
Use the extended Euclidean algorithm to find the greatest common divisor of and and express it as a linear combination of and
Step : Find
q
and
r
so that
q r
where
r
Then
r q
Correct: Your answer is correct.
Step : Find
q
and
r
so that
r q r
where
r r
Then
r
Correct: Your answer is correct.
q
Correct: Your answer is correct.
Step : Find
q
and
r
so that
r r q r
where
r r
Then
r
Correct: Your answer is correct.
Correct: Your answer is correct.
q
Correct: Your answer is correct.
Step : Find
q
and
r
so that
r r q r
where
r r
Then
r
Correct: Your answer is correct.
Correct: Your answer is correct.
q
Correct: Your answer is correct.
Step : Find
q
and
r
so that
r r q r
where
r r
Then
r
Correct: Your answer is correct.
Correct: Your answer is correct.
q
Correct: Your answer is correct.
Step : Conclude that
gcd
equals which of the following.
gcd r r q
gcd r r q
gcd r r q
gcd r r q
gcd r r q
Correct: Your answer is correct.
Conclusion: Substitute numerical values backward through the preceding steps, simplifying the results for each step, until you have found numbers s and t so that
gcd s t
where
s
Incorrect: Your answer is incorrect.
and
t
Incorrect: Your answer is incorrect.
Need Help?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
