Question

Use euclid's division algorithm to find the hcf of 286 and 49330
​

Answer 1

Step-by-step explanation:

mark as brainliest plsss......

Answer 2

Given:

286 and 49330

To find:

hcf of 286 and 49330

Solution:

1) Euclids Division Algorithm is a technique to find the Highest Common Factor (HCF) of two given positive integer a and b given.

2)  HCF of any two positive integers a and b is the largest positive integer which  divides the both integers a and b.

3) Euclid division algorithm:

• 49330 = 286 × 172 + 138

• 286 = 138 × 2 + 10

• 138 = 10 × 13 + 8

• 10  = 8 × 1 + 2

• 8    = 2×4 + 0

HCF of 286 and 49330 is 2