1
You visited us
1
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard VI
Mathematics
HCF
Find g.c.d of...
Question
Find g.c.d of (i)
135
and
225
(ii)
38220
and
196
by Euclid's algorithm.
Open in App
Solution
By division algorithm
225
=
135
(
1
)
+
90
135
=
90
(
1
)
+
45
90
=
45
(
2
)
+
0
g
c
d
(
135
,
225
)
=
45
As we know
38220
>
196
We know
a
=
b
q
+
r
0
≤
r
≤
b
38220
=
196
×
195
+
0
So,
196
is gcd.
Hence, this is the answer.
Suggest Corrections
0
Similar questions
Q.
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.
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 algorithm to find the HCF of
196
and
38220
.
Q.
Question 1 (ii)
Use Euclid's division algorithm to find the HCF of:
(ii) 196 and 38220
Q.
Use Euclid's division algorithm to find the HCF of: 196 and 38220
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
Special Factors and Multiples
MATHEMATICS
Watch in App
Explore more
HCF
Standard VI 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