Math, asked by kalravvarshney, 1 year ago

Find the HCF of numbers 72 and 96 by Euclid‟s division algorithm and express it in the

form

96m  72n

, where

m

and

n

are integers.

Answers

Answered by shashankjharaniya
1
by Euclid division algorithm

a=bq+r
Here,
96>72

96=72*1+24
72=24*3+0

hence,the remainder is 0
HCF=24
Similar questions