Question

hcf by euclids algorithm method​

Answer 1

Step 1 : choose bigger number : 1188>504

On dividing 1188 by 504, we get

Quotient = 2 and remainder = 180

⇒1188=504×2+180

Step 2: on dividing 504 by 180

Quotient = 2 and remainder = 144

⇒504=180×2+144

Step 3 : on dividing 180 by 144

quotient = 1 and remainder = 36

⇒180=144×1+36

Step 4 : On dividing 144 by 36

quotient = 4 and remainder =0

⇒144=36×4+0

Since remainder is zero, stop the process

therefore, HCF of 1188 and 504 is 36

iii) To find HCF of 960 and 1575

1575 = 960 × 1 + 615

960 = 615 × 1 + 345

615 = 345 × 1 + 270

345 = 270 × 1 + 75

270 = 75 × 3 + 45

75 = 45 × 1 + 30

45 = 30 × 1 + 15

30 = 15 × 2 + 0

Now remainder is equal to zero.

Therefore ,

HCF ( 960 , 1575 ) = 15

Answer 2

Answer:

answer for the given problem is given