3
You visited us
3
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard X
Mathematics
HCF Using Euclid's Division Algorithm
Find the HCF ...
Question
Find the HCF of 336 and 54 using euclid's division lemma.
Open in App
Solution
Since
336
>
54
, we apply the division lemma to
336
and
54
to obtain
336
=
54
×
6
+
12
Since remainder
12
≠
0
, we apply the division lemma to
336
and
54
to obtain
54
=
12
×
4
+
6
Since remainder
6
≠
0
, we apply the division lemma to
54
and
12
to obtain
12
=
6
×
2
+
0
Since the remainder is zero, then he process stops.
Since the divisor at this stage is
336
, therefore the HCF of
336
and
54
is
6
Suggest Corrections
0
Similar questions
Q.
Find the HCF of 15 and 18 using Euclids Division Lemma.
Q.
Find the H.C.F. of
180
,
252
and
324
using Euclid division of lemma.
Q.
Find the
H
C
F
of
25
and
140
using Euclid division algorithum.
Q.
Use Euclids division algorithm to find the HCF of:
867
and
225
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
HCF Using Euclid's Division Algorithm
MATHEMATICS
Watch in App
Explore more
HCF Using 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