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
Differentiation Formulas : We will begin this section with some basic properties and formulas.  We will give the properties & formulas in this section in both "prime" notation &

Properties Now there are a couple of formulas for summation notation. 1. here c is any number. Therefore, we can factor constants out of a summation. 2. T

A 50-foot pole casts a shadow on the ground. a) Express the angle of elevation θ of the sun as a function of the length s of the shadow. (Hint you may wish to draw this firs


Ask question I have 2 problems I need them after 7 hours

Determine how many square centimeters of paper are needed to make a label on a cylindrical can 45 cm tall with a circular base having diameter of 20 cm. Leave answer in terms of π.

which laws of physics are used to discuss heat loss in a pipe

Find out the two inputs when the NAND gate output will be low. Ans. The output of NAND gate will be low if the two inputs are 11. The Truth Table of NAND gate is shown

Ask Suppose I offer you a loan to start a safety matchstick production unit on the following terms: I shall first advance you Rs.50,000/- to set up your unit, and wait for 3 month

Demonstrate that Dijkstra's algorithm does not necessarily work if some of the costs are negative by finding a digraph with negative costs (but no negative cost dicircuits) for whi