Question

find the hcf of 1260and7344 using Euclids algorithm​

Answer 1

Hope this will help you....

Answer 2

Answer:

HCF=36

Step-by-step explanation:

Step1: According to Euclid's Algorithm

Here we have C and D two digits whose HCF we have to find Out such that C>D

and C=DQ+R

Where We have to divide C by D thus C become Divisor and D becomes Dividend and Q is Quotient and R=Remainder

For Eg: here in this Question C=7344 Because C>D

D=1260

Now divide 7344 by 1240 thus we get Q=5 And R=1044

thus Equation become

C=D*Q+R

7344=1260*5+1044

Step 2: Now Repeat Step 1 untill we Get Remainder =0;

thus now C becomes 1260 and D Becomes 1044

now divide C by D

thus the next equation we get

C=D*Q+R

1260=1044*1+216

Again Rem=216 which is not equals to 0 thus repeat above process

where C=1044 and D=216

now Again divide C by D

Now Equation we get

C=D*Q+R

1044=216*4+180

Rem =180 which is not equals to 0 thus repeat above procedure

where C=216 and D=180

now Again divide C by D

Now Equation we get

C=D*Q+R

216=180*1+36

Rem =36 which is not equals to 0 thus repeat above procedure

where C=180 and D=36

now Again divide C by D

Now Equation we get

C=D*Q+R

180=36*5+0

now Rem =0

thus Divisor that is D becomes HCF

Therefore

HCF=36