3
You visited us
3
times! Enjoying our articles?
Unlock Full Access!
Byju's Answer
Standard X
Mathematics
Euclid's Division Algorithm
Find the larg...
Question
Find the largest number that divides
455
and
42
with the help of division algorithm.
Open in App
Solution
i) Start with the larger integer
,
455
42
)
455
(
10
→
quotient
420
35
→
remainder
∴
455
=
(
42
×
10
)
+
35
(By Euclid's lemma)
ii) Consider
42
÷
35
iii) Consider
35
÷
7
35
)
42
(
1
7
)
35
(
5
35
35
7
00
∴
42
=
(
35
×
1
)
+
7
∴
35
=
(
7
×
5
)
+
0
⇒
H
C
F
(
455
,
42
)
=
H
C
F
(
42
,
35
)
=
H
C
F
(
35
,
7
)
=
7
∴
7
is the largest number that divides
455
and
42
.
Suggest Corrections
0
Similar questions
Q.
Using Euclid's division algorithm find HCF of
455
and
42.
Q.
Question 9
Using Euclid’s division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively.
Q.
The HCF of
455
and
42
using Euclid algorithm is
Q.
Divide the largest 5 digit number by 653. Check your answer by the division algorithm.