Please show all steps. Thanks. In this problem we work out step-by-step the Exte

Question

Please show all steps. Thanks.

In this problem we work out step-by-step the Extended Euclidean Algorithm. Specifically, we will find two integers x, y so that 1285x + 630y = gcd(1285,630). To do this we first apply the Euclidean Algorithm to compute gcd(1285, 630), and then unwind the calculation to find x and y. Good! You have found that 1285 = 630 times 2 + 25 630 = 25 Times 2 + 5 Furthermore, 5 divides 630, so the Euclidean Algorithm stops at this stage, and gcd(1285, 630) = In this problem we work out step by step the Extended Euclidean Algorithm. Specifically, we find two integers x, y so that 1285x + 630y = gcd(1285,630). To do this we first apply the Euclidean Algorithm to compute gcd(1285, 630), and then unwind the calculation to find x and y. Using the Euclidean algorithm, we have now found that 1285 = 630 times 2 + 25 630 = 25 times 25 + 5 and gcd(1285, 630) = 5. To find integers x, y so that 1285x + 630y = gcd(1285, 630) = 5, we now unwind the equations above. We begin with the last one: 630 = 25 times 25 + 5 Since we areinterested in the gcd, we rewrite this as 5 = 630 + 25 times

Explanation / Answer

3. 5

4. 5= 630+25*(-25)

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.