Scribd
Upload
591 views1 page

Math Class 10th: Exercise 1.1

This math problem asks students to use Euclid's division algorithm to find the highest common factor (HCF) of three pairs of numbers: 1) 135 and 225, 2) 196 and 38220, 3) 867 and 255. For the first pair, 135 goes into 225 once with a remainder of 90, then 135 goes into 90 twice with a remainder of 45, and finally 90 goes into 45 twice with a remainder of 0. Therefore, the HCF of 135 and 225 is 45.

Uploaded by

kulls
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
591 views1 page

Math Class 10th: Exercise 1.1

This math problem asks students to use Euclid's division algorithm to find the highest common factor (HCF) of three pairs of numbers: 1) 135 and 225, 2) 196 and 38220, 3) 867 and 255. For the first pair, 135 goes into 225 once with a remainder of 90, then 135 goes into 90 twice with a remainder of 45, and finally 90 goes into 45 twice with a remainder of 0. Therefore, the HCF of 135 and 225 is 45.

Uploaded by

kulls
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Math class 10th

Exercise 1.1

Question 1. use euclids division algorithm to find the hcf of -


1. 135and 225 2. 196 and 38220 3. 867 and 255
here ,225.135
So, we get on using divion algorithm at225>135
a=bq+r
step1. 225=135x1+90
step 2.135=30x1+45
step 3.90=45x2+0
here, the new divisor is 4
l

You might also like