Browse by Stream
QnA
Home
QnA
Go To Your Study Dashboard

Get Answers to all your Questions

header-bg qa
  • Home
  • NCERT
  • Use Euclid' s division algorithm to find the HCF of : 135 and 225

Use Euclid’s division algorithm to find the HCF of : 135 and 225

Answers (1)

225 > 135. Applying Euclid's Division algorithm we get

225=135\times 1+90

since remainder \neq 0 we again apply the algorithm

135=90\times 1+45

since remainder \neq 0 we again apply the algorithm

90=45\times 2

since remainder = 0 we conclude the HCF of 135 and 225 is 45.

Posted by

lovekush

View full answer

Similar Questions

Trending Articles/News

anam-khan

Board Exam Date 2025 Live: Bihar Class 10, 12 model papers out, time table soon; updates on CBSE, UP
anam-khan

CBSE Class 10 board exams from February 15 to March 18; download date sheet 2025 PDF

Latest Question