Math, asked by vrbrt110, 10 months ago

SECTIONICA
27. Find the HCF of 1260 and 7344 using Euclid's algorithm​

Answers

Answered by nazia21
1

Answer:

HCF = 36

Step-by-step explanation:

we used here Euclid division lemma which is

a= bq+r

.in which a is dividend

b is divisor

q is quotient

and r is remainder

Attachments:
Similar questions