Question

72 and 105 using euclid division algorithm

Answer 1

105=72*1+33
72=33*2+6
33=6*5+3
6=3*2+0
hcf =3

Answer 2

Consider the greater number as 'a ' & smaller number as 'b' and then apply euclid's division algorithm to get the required HCF

Euclid's Division algorithm
a= bq+r

Here, 105>72

Let a= 105, b= 72

By using euclid's division Lemma,

105= 72×1+33

Here Remainder = 33≠0

Again on applying euclid's division Lemma

72= 33×2+ 6

Here, Remainder = 6≠0

Again on applying euclid's division Lemma

33= 6×5+3

Here, Remainder= 3≠0

Again on applying euclid's division Lemma

6= 3×2+ 0

Here , Remainder = 0 & divisor is 3

Hence, the HCF of 72 & 105 is 3

==================================================================

Hope this will help you...