Tamilnadu BoardEnglish MediumSTD 10MATHSNumbers and Sequences2 Marks
Question
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 10224 and 9648
✓
Answer
To find H.C.F. 10224 and 9648, Using Euclid’s division algorithm. We get 10224 = 9648 × 1 + 576 The remainder 576 ≠ 0. Again using Euclid’s division algorithm 9648 = 576 × 16 + 432 Remainder 432 ≠ 0. Again applying Euclid’s division algorithm 576 = 432 × 1 + 144 Remainder 144 ≠ 0. Again using Euclid’s division algorithm 432 = 144 × 3 + 0 The remainder is zero. ∴ HCF = 144 The H.C.F. of 10224 and 9648 is 144.
Need a full question paper?
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.