Question

Use Euclid's division algorithm to find the hcf of 10211 and 2517​

Answer 1

Answer:

Hcf of 10211 and 2517 is 1

Answer 2

Concept:

If a and b are two positive integers then they must satisfy the condition a = bq + r where 0 ≤ r < b.

Given:

The numbers are 10211 and 2517.

Find:

We have to find the HCF of 10211 and 2517 by using Euclid's division algorithm.

Solution:

Since 10211 > 2517

By using Euclid's division algorithm

10211 = 3517 × 4 + 143

Here remainder ≠ 0

So, again using Euclid's division algorithm

2517 = 143 × 17 + 86

Here remainder ≠ 0

So, again using Euclid's division algorithm

143 = 86 × 1 + 57

Here remainder ≠ 0

So, again using Euclid's division algorithm

86 = 57 × 1 + 29

Here remainder ≠ 0

So, again using Euclid's division algorithm

57 = 29 × 1 + 28

Here remainder ≠ 0

So, again using Euclid's division algorithm

29 = 28 × 1 + 1

Here remainder ≠ 0

So, again using Euclid's division algorithm

28 = 1 × 28 + 0

Here, the remainder = 0

Since the last non-zero remainder is 1.

HCF (10211 and 2517) =1

Hence, the HCF of 10211 and 2517 by using Euclid's division algorithm is 1.

#SPJ2