1
You visited us
1
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard X
Mathematics
Euclid's Division Algorithm
If d is the...
Question
If
d
is the
H
C
F
of
56
and
72
,
find
x
,
y
satisfying
d
=
56
x
+
72
y
.
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
16
≠
0
. So, we consider the divisor
56
and remainder
16
and apply division lemma to get
56
=
16
×
3
+
8
..........
(
i
i
)
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
H
C
F
of
56
and
72
.
From
(
i
i
)
, we get
8
=
56
−
16
×
3
⇒
8
=
56
−
(
72
−
56
×
1
)
×
3
⇒
8
=
56
−
3
×
72
+
56
×
3
⇒
8
=
56
×
4
+
(
−
3
)
×
72
∴
x
=
4
and
y
=
−
3
.
Now,
8
=
56
×
4
+
(
−
3
)
×
72
⇒
8
=
56
×
4
+
(
−
3
)
×
72
−
56
×
72
+
56
×
72
⇒
8
=
56
×
4
−
56
×
72
+
(
−
3
)
×
72
+
56
×
72
⇒
8
=
56
×
(
4
−
72
)
+
{
(
−
3
)
+
56
}
×
72
⇒
8
=
56
×
(
−
68
)
+
(
53
)
×
72
∴
x
=
−
68
and
y
=
53
.
Hence
x
and
y
are not unique.
Suggest Corrections
1
Similar questions
Q.
If 'd' is the HCF of 30,72,find the value of 'x' and 'y' satisfying d=30x+72y.
Q.
If
d
is the HCF of
30
and
72
with a linear equation
d
=
30
x
+
72
y
find
x
and
y
.
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
Related Videos
Euclid's Division Algorithm_Tackle
MATHEMATICS
Watch in App
Explore more
Euclid's Division Algorithm
Standard X Mathematics
Join BYJU'S Learning Program
Grade/Exam
1st Grade
2nd Grade
3rd Grade
4th Grade
5th Grade
6th grade
7th grade
8th Grade
9th Grade
10th Grade
11th Grade
12th Grade
Submit
AI Tutor
Textbooks
Question Papers
Install app