Find HCF of 135 and 225 by Euclid’s division algorithm ?

The Biotic World is the best free Educational Website for Students. The Biotic World Provides NCERT Solution PDFCBSE Notes PDFNCERT Books PDF for class 8, 9, 10, 11, 12. The Biotic World also provides GU TDC SyllabusPrevious Years Question PapersTDC notes on different topics of Physics, Chemistry, Mathematics, Zoology and Botany any many more. So, Follow us to get tuned with latest updates.

Find HCF 135 and 225 by Euclid’s division algorithm, class 10 math chapter-1, exercise -1.1 question 1.(i)

Solution:

⇨ First choose the largest number among the given number and write it equal to the product of smaller number.
⇨ Here largest number is 225
⇨ 225=135 x 1 + 90
⇨ 135=90 x 1 + 45
⇨ 90=45 x 2 + 0
⇨ When Reminder becomes zero then last multiple with the prime number will be our HCF.
⇨HCF (135,225) = 45

Post a Comment

Follow Us For Future Updates.

Previous Post Next Post