Login
Home
TOP
Send feedback
Login
Subjects
Maths TNSB Mentoring
Class 10
Numbers and sequences
Euclid division lemma
7.
TBQ - Find the HCF
Question:
5
m.
Use Eculid's Division Algorithm to
find
the Highest Common Factor (HCF) of:
10224
and
9648
Since
\(>\)
, apply Euclid's division lemma.
i
=
i
×
i
+
i
i
=
i
×
i
+
i
i
=
i
×
i
+
i
i
=
i
×
i
+
0
HCF of
10224
and
9648
\(=\)
[
Note
: Enter the values in the order specified by the division algorithm.]
Login
or
Fast registration
Previous task
Exit to the topic
Next task
Send feedback
Did you find an error?
Send it to us!