Question

use euclids division algorithm to find the HCF of 135 and 225​

Answer 1

Answer:

Step-by-step explanation:

Solution :-

Since 225 > 135, we apply the division lemma to 225 and 135 to obtain

225 = 135 × 1 + 90

Since remainder 90 ≠ 0, we apply the division lemma

The quotient is 1 and remainder is 90.

225 = 135 × 1 + 90

Divide 135 by 90

The quotient is 1 and remainder is 45.

135 = 90 × 1 + 45

Divide 90 by 45.

The quotient is 2 and remainder is 0.

90 = 2 × 45 + 0

Hence, the HCF is 45.

Answer 2

Answer:

• The divisor at this stage, ie, 45 is the HCF of 225 and 135.

Given :

• The number 135 and 225.

To find :

• Use euclids division algorithm to find HCF.

Step-by-step explanation:

Clearly, 225 > 135

Applying the Euclid's division lemma to 225 and 135, we get

225 = 135 × 1 + 90

Since the remainder 135 ≠ 0, we apply the Euclid's division lemma to divisor 135 and remainder 90 to get

135 = 90 × 1 + 45

We consider the new divisor 135 and remainder 45 and apply the division lemma to get

90 = 45 × 2 + 0

Now, the remainder at this stage is 0.

So, the divisor at this stage, ie, 45 is the HCF of 225 and 135.