CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

If d is the HCF of 56 and 72, find x, y satisfying d=56x+72y. Also, show that x and y are not unique.

Open in App
Solution

Applying Euclids division lemma to 56 and 72, we get
72=56×1+16

Since the remainder 160. So, we consider the divisor 56 and remainder 16 and apply division lemma to get
56=16×3+8 ..........(ii)

We consider the divisor 16 and the remainder 8 and apply division algorithm to get
16=8×2+0

We observe that the remainder at this stage is zero. Therefore, last divisor 8 (or the remainder at the earlier stage) is the HCF of 56 and 72.

From (ii), we get
8=5616×3
8=56(7256×1)×3
8=563×72+56×3
8=56×4+(3)×72
x=4 and y=3.

Now,8=56×4+(3)×72
8=56×4+(3)×7256×72+56×72
8=56×456×72+(3)×72+56×72
8=56×(472)+{(3)+56}×72
8=56×(68)+(53)×72
x=68 and y=53.

Hence x and y are not unique.

flag
Suggest Corrections
thumbs-up
1
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Euclid's Division Algorithm_Tackle
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon