1
You visited us
1
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard X
Mathematics
Euclid's Division Algorithm
Use Euclid's ...
Question
Use Euclid's division algorithm to find the HCF of:
(i)
135
and
225
(ii)
196
and
38220
(iii)
867
and
255
.
Find the highest HCF among them.
Open in App
Solution
(i) By Euclid's division lemma,
225
=
135
×
1
+
90
r
=
90
≠
0
135
=
90
×
1
+
45
r
=
45
≠
0
90
=
45
×
2
+
0
r
=
0
So,H.C.F of
135
and
225
is
45
(ii) By Euclid's division lemma,
38220
=
196
×
195
+
0
r
=
0
So, H.C.F of
38220
and
196
is
196
(iii) By Euclid's division lemma,
867
=
255
×
3
+
102
r
=
102
≠
0
255
=
102
×
2
+
51
r
=
51
≠
0
102
=
51
×
2
+
0
r
=
0
So, H.C.F of
867
and
255
is
51
The highest HCF among the three is
196
.
Suggest Corrections
3
Similar questions
Q.
Use Euclids division algorithm to find the HCF of:
(i)
135
and
225
(ii)
196
and
38220
(iii)
867
and
225
Q.
Use Euclid's division algorithm to find the HCF of:
867
and
255
Q.
Use Euclid's division algorithm to find HCF of 867 and 255.
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