Question

find the Hcf of 34 and 156 using euclid algorithm​

Answer 1

Answer:

May be this given below photo will help you

Answer 2

Given: use of euclid's division algorithm

To find: HCF of 34 and 156

Solution:

1) Euclid's Division Lemma states that, if two positive integers a and b, then there exists unique integers q and r such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b.

2) Now use the euclid's division lemma as given below we will apply this lemma until we get the remainder as 0.

156 = 34 × 4 + 20

34 = 20 × 1 + 14

20 = 14 × 1 + 6

14. = 6 × 2 + 2

6 = 3 × 2 + 0

So last divisor is the HCF of the given two numbers

HCF of 34 and 156 is 3.