Question

use Euclid's division algorithm to find the highest common factor
1.340 and 412​

Answer 1

Answer:

Step-by-step explanation:

Euclid's division algorithm is a technique to compute the Highest Common Factor (HCF) of two or three given positive integers.

Euclid's division Lemma states that for any two positive integers say a and b there exist two unique whole numbers say q and r ,such that, a = bq+r, where 0≤r<b.

SOLUTION:

On applying euclid's division Lemma for 16 and 28

28 = 16 ×1 + 12

Here, Remainder = 12≠0

So take new Dividend as 16 and divisor as 12.

16 = 12×1 +4

Here, Remainder = 14≠0

So take new Dividend as 12 and divisor as 4.

12 = 4×3 +0

Here, the Remainder = 0 and the last divisor is 4.

Hence, HCF of 16 and 28 is 4.

HOPE THIS WILL HELP YOU....

Answer 2

Answer:

HCF (340,412)

412 = 340 ×1 + 72

since, remainder does not equal to zero

340 = 72 × 4 + 40

72 = 40 ×1 + 32

40= 32 × 1 +8

32 = 8 × 4 + 0

Here,remainder = 0 therefore HCF will be 8.