Using euclid''s algorithm find the value of x & y, Mathematics

If d is the HCF of 30, 72, find the value of x & y satisfying d = 30x + 72y.

(Ans:5, -2 (Not unique)

Ans:    Using Euclid's algorithm, the HCF (30, 72)

72 = 30 × 2 + 12

30 = 12 × 2 + 6

12 = 6 × 2 + 0

HCF (30,72) = 6

6=30-12×2

6=30-(72-30×2)2

6=30-2×72+30×4

6=30×5+72×-2

∴ x = 5, y = -2

Also 6 = 30 × 5 + 72 (-2) + 30 × 72 - 30 × 72

Solve it, to get

x = 77, y = -32

Hence, x and y are not unique

Posted Date: 4/8/2013 1:06:39 AM | Location : United States







Related Discussions:- Using euclid''s algorithm find the value of x & y, Assignment Help, Ask Question on Using euclid''s algorithm find the value of x & y, Get Answer, Expert's Help, Using euclid''s algorithm find the value of x & y Discussions

Write discussion on Using euclid''s algorithm find the value of x & y
Your posts are moderated
Related Questions
Finding the number of Permutations of 'n' dissimilar things taken 'r' at a time:  After looking at the definition of permutations, we look at how to evolve a

On each day t of n days, N customers of a supermarket were sampled and the number Xt expressing dissatisfaction was recorded. The results suggested that there were good and bad day


Solve for x: 4 log x = log (15 x 2 + 16) Solution:              x 4 - 15 x 2 - 16 = 0                (x 2 + 1)(x 2 - 16) = 0                x = ± 4   But log x is

Determine or find out if the sets of vectors are parallel or not. (a) a → = (2,-4,1), b = (-6, 12 , -3) (b) a → = (4,10), b = (2,9) Solution (a) These two vectors

AFIGURE THIS OUT(3) (14) (17) (20) (25)= 8 WHAT ARE THE PROCEDURES (-)(+)(x)(div) BETWEEN EACH NUMBER TO COME UP WITH 8 ?


When I complete each of the three methods, should I get the same x and y values?

Find the probability of drawing a diamond card in each of the consecutive draws from a well shuffled pack of cards,if the card drawn is not replaced after the first draw.

2.    Suppose a file of 35,000 characters is to be sent over a line at 55,000bps. 1. Calculate the overhead in bits and time using asynchronous transmission. Assume 1 start bit