Question

using Euclid's algorithm division find hcf of 50 amd 60​

Answer 1

Answer:

10

Step-by-step explanation:

Step 1: Since 60 > 50, we apply the division lemma to 60 and 50, to get

60 = 50 x 1 + 10

Step 2: Since the reminder 50 ≠ 0, we apply division lemma to 10 and 50, to get

50 = 10 x 5 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 10, the HCF of 50 and 60 is 10

Notice that 10 = HCF(50,10) = HCF(60,50) .

Therefore, HCF of 50,60 using Euclid's division lemma is 10