Browse by Stream
QnA
Home
QnA
Go To Your Study Dashboard

Get Answers to all your Questions

header-bg qa
  • Home
  • School
  • Find the HCF of 1260 and 7344 using Euclid's algorithm.        

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

 

 
 
 
 
 

Answers (1)

Euclid's division algorithm says,

a=bq+r

 where q is the quotient , b is divisor and r is the remainder and 0\leq r\leq b

In 1260 and 7344 we will consider greater number first followed by another number

7344=1260\times 5+1044

In the next step we will perform the same. thing with the divisor and remainder which are 1260 and 1044.

1260=1044\times 4+216

The process will be done again and again till the time we dont receive 0 as remainder.

1044=216\times 4+180

216=180\times 1+36

180=36\times 5+0

 Here we received 0 with divisor 36. Hence 36 will be the HCF of 1260 and 7344.

Posted by

Safeer PP

View full answer

Similar Questions

Latest Question