Question

Using Euclid's division algorithm,find the HCF of 1260 and 7344.​

Answer 1

Answer:

Step 1 : divide 7344 by 1260,

Quotient = 5 remainder = 1044,

Step 2: divide divisor 1260 by remainder,

Quotient = 1 remainder = 216,

Step 3: Repeat the above steps until we get remainder 0.

Thus, the last quotient which gives the remainder zero is 36.

Answer 2

Answer:

36

Step-by-step explanation:

Since,7344>1260,to find HCF of 7344 and 1260 we have to divide 7344 by 1260( larger by smaller)

Step1. By Euclid's lemma,we have,

7344=1260*5+1044

Step2. Since remainder is not 0 ,we continue division by( dividing the remainder by previous divisor),

1260=1044*1+216

Step3. Since remainder is not 0,we continue the algorithm.

By Euclid's lemma,

1044=216*4+180

Step4. Still remainder ≠ 0 ,so by Euclid's lemma,

216=180*1+36

Step5 Since remainder ≠ 0, we continue to divide

180= 36*5+0

Since remainder=0 ,the required HCF is 36