Questions LLC
Login
or
Sign Up
Ask a New Question
Questions
Mathematics
Use the Extended Euclidean Algorithm to find the values of s and t, such that gcd(430, 410) = s * 430 + t * 410
1 answer
so, what steps have you followed to apply the algorithm?
You can
ask a new question
or
answer this question
.
Related Questions
A point p(x,y) is on the line through A(-4,4) and B(5,2).Find (a) the coordinates of P given that the segment AB is extended
1. Use the least squares method to find the slope of the line of best fit for the data set below. Round to three decimal places.
If a and b are positive integers, prove that:
ab = gcd(a,b)*lcm(a,b). Can visualize this being true and easily create examples
The Gcd and lcm are 6 and 1080 respectively if the two numbers are 72 and 60,find the third number
GCD (24,20)IS 4. sINCE gcd (4,12) IS 4, THEN gcd (24,20,12) is 4.
use this approach and the euclidean algorithim to find the GCD
Use the Euclidean Algorithm to find gcd(112,15)
(a) Use the Euclidean Algorithm to nd gcd (2017; 271) and use this to nd integers x and y so that gcd(2017; 271) = 2017x + 271y.
Question. Find the greatest common divisor d of 159 and 51, and find integers x and y solving the equation 159 x + 51 y = d .
Ans
GCD (24,20) IS 4. sINCE gcd(4,12 ) is 4 then GCD (24,2012 IS 4
USE Euclidem LGERITHM TO FIND THE gcd 722, 2413,209
This is a problem concerning GCD.
I need to prove gcd(a,b) = gcd(a,b+a). I always get like like halfway then hit a roadblock