Question

use euclid's division algorithm to find hcf of 170and136​

Answer 1

Euclid's division algorithm is based on the Euclid's division lemma, which states that --

a = bq + r ; 0 is less than or equals to r and r is less than b.

Here, a = 170 and b = 136.

On dividing,

170 = 136 × 1 + 34

136 = 34 × 4 + 0

So, Here, 34 will be the HCF of 170 and 136.

Answer 2

HEYA

Euclid's division algorithm

=a=bq+r

a=170,b=136

170=136*1+34

136=34*4+0

34

is the hcf of 170 and 136

please make me as BRAINLIST