use Euclid division algorithm to find the HCF of 132 and 225 Related: ...
Since 225 is greater than 135,
225=135×1+90,
since, reminder is 90≠0, we apply the process again,
135=90×1+45,
applying the process again,till will we get 0 as reminder,
90=45×2+0,
so, HCF(132,225)=45
use Euclid division algorithm to find the HCF of 132 and 225 Related: ...
To find the HCF (Highest Common Factor) of 132 and 225 using Euclid's division algorithm, we will divide the larger number by the smaller number and continue dividing the remainder by the divisor until we get a remainder of 0.
Step 1: Divide 225 by 132.
225 ÷ 132 = 1 remainder 93
Step 2: Now divide 132 by 93.
132 ÷ 93 = 1 remainder 39
Step 3: Divide 93 by 39.
93 ÷ 39 = 2 remainder 15
Step 4: Divide 39 by 15.
39 ÷ 15 = 2 remainder 9
Step 5: Divide 15 by 9.
15 ÷ 9 = 1 remainder 6
Step 6: Divide 9 by 6.
9 ÷ 6 = 1 remainder 3
Step 7: Divide 6 by 3.
6 ÷ 3 = 2 remainder 0
Since we have obtained a remainder of 0, we stop the division process.
The last divisor used, which is 3, is the HCF of 132 and 225.
Therefore, the HCF of 132 and 225 is 3.
To make sure you are not studying endlessly, EduRev has designed Class 10 study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Class 10.