Question

Amita tries to find the highest common factor of a and b using Euclid's division algorithm. In one of her steps, she divides 225 by 135. Find the highest common factor of a and b.

Answer 1

UGC I don't know what to

Answer 2

Given:

225 by 135

To find:

The HCF of 225 and 135

Solution:

Euclid's division lemma state that when you divide a dividend with any of the divisor you will get the quotient and remainder, and that remainder must lie from 0 to less than the divisor of the question.

we have the numbers

225 by 135

• 225 = 135×1+90
• 135 = 90×1+45
• 90 = 45×2+0

Last divisor is the HCF of 225 and 135

so,

The HCF of 225 and 135 is 45