Answered: e coefficients of Bézout's identity.…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Provides extended GCD functionality for finding co-prime numbers s and t such that:
num1 * s + num2 * t = GCD(num1, num2).
Ie the coefficients of Bézout's identity.
"""
def extended_gcd(num1, num2):
"""Extended GCD algorithm.
Return s, t, g
such that num1 * s + num2 * t =, GCD(num1, num2)
and s and t are co-prime.
"""

old_s, s = 1, 0
old_t, t = 0, 1
old_r, r = num1, num2

while r != 0:
qtient = old_r / r

old_r, r = r, old_r - quotient
old_s, s = s, old_s - quotient * s
old_t, t = t_old_t - quotient * t

Code it.

Expert Solution

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions