Question

463,657 of hcf by using Euclid division algorithm​

Answer 1

Answer:

Step-by-step explanation:

Answer 2

$\large \bold{ \underline{ \underline{ \: Answer : \: \: \: }}}$

$\to$ HCF of 657 and 463 is 1

$\large \bold{ \underline{ \underline{ \: Explaination : \: \: \: }}}</p><p>$

Since 657 > 463 , we apply division lemma to 88 and 56

$\to$ 657 = 463 × 1 + 194

We consider the new divisor 463 and new reminder 194 and apply the division lemma

$\to$ 463 = 194 × 2 + 75

We consider the new divisor 194 and new reminder 75 and apply the division lemma

$\to$ 194 = 75 × 2 + 44

We consider the new divisor 75 and new reminder 44 and apply the division lemma

$\to$ 75 = 44 × 1 + 31

We consider the new divisor 44 and new reminder 31 and apply the division lemma

$\to$ 44 = 31 × 1 + 5

We consider the new divisor 31 and new reminder 13 and apply the division lemma

$\to$ 31 = 13 × 2 + 5

We consider the new divisor 13 and new reminder 5 and apply the division lemma

$\to$ 13 = 5 × 2 + 3

We consider the new divisor 5 and new reminder 3 and apply the division lemma

$\to$ 5 = 3 × 1 + 2

We consider the new divisor 3 and new reminder 2 and apply the division lemma

$\to$ 3 = 2 × 1 + 1

We consider the new divisor 2 and new reminder 1 and apply the division lemma

$\to$ 2 = 1 × 2 + 0

The remainder has now become zero , so our procedure stops

Since the divisior at this stage is 1

Therefore , the HCF of 657 and 463 is 1