Solve
Study
Textbooks
Guides
Join / Login
>>
Class 10
>>
Maths
>>
Real Numbers
>>
Euclid's Division Lemma
>>
Use Euclid's division algorithm to find
Question
Use Euclid's division algorithm to find the HCF of:
(i)
1
3
5
and
2
2
5
(ii)
1
9
6
and
3
8
2
2
0
(iii)
8
6
7
and
2
5
5
.
Find the highest HCF among them.
Medium
Open in App
Solution
Verified by Toppr
Correct option is A)
(i) By Euclid's division lemma,
2
2
5
=
1
3
5
×
1
+
9
0
r
=
9
0
=
0
1
3
5
=
9
0
×
1
+
4
5
r
=
4
5
=
0
9
0
=
4
5
×
2
+
0
r
=
0
So,H.C.F of
1
3
5
and
2
2
5
is
4
5
(ii) By Euclid's division lemma,
3
8
2
2
0
=
1
9
6
×
1
9
5
+
0
r
=
0
So, H.C.F of
3
8
2
2
0
and
1
9
6
is
1
9
6
(iii) By Euclid's division lemma,
8
6
7
=
2
5
5
×
3
+
1
0
2
r
=
1
0
2
=
0
2
5
5
=
1
0
2
×
2
+
5
1
r
=
5
1
=
0
1
0
2
=
5
1
×
2
+
0
r
=
0
So, H.C.F of
8
6
7
and
2
5
5
is
5
1
The highest HCF among the three is
1
9
6
.
Solve any question of
Real Numbers
with:-
Patterns of problems
>
Was this answer helpful?
0
0
Similar questions
Use Euclids division algorithm to find the HCF of:
(i)
1
3
5
and
2
2
5
(ii)
1
9
6
and
3
8
2
2
0
(iii)
8
6
7
and
2
2
5
Hard
View solution
>
Using Euclid's division algorithm, find the HCF of
4
4
0
7
,
2
9
3
8
and
1
4
6
9
.
Medium
View solution
>
Use Euclid's division algorithm to find the HCF of:
(i)
9
6
0
and
4
3
2
(ii)
4
0
5
2
and
1
2
5
7
6
Medium
View solution
>
Using Euclid's division algorithm, find the HCF of
1
3
5
and
2
2
5
.
Medium
View solution
>
Using Euclid's division algorithm, find the HCF of
4
0
5
2
and
1
2
5
7
6
.
Medium
View solution
>
View more
More From Chapter
Real Numbers
View chapter
>
Revise with Concepts
Euclid's Division Lemma
Example
Definitions
Formulaes
Learn with Videos
Euclids Division Algorithm
4 mins
Shortcuts & Tips
Cheatsheets
>
Memorization tricks
>
Important Diagrams
>
Problem solving tips
>
Common Misconceptions
>
Mindmap
>
Practice more questions
Easy Questions
195 Qs
>
Medium Questions
562 Qs
>
Hard Questions
32 Qs
>