Question

HCF by euclids algorithm method​

Answer 1

Highest Common Factor of 1651, 2032 using Euclid's algorithm

HCF of 1651, 2032 is 127 the largest number which exactly divides all the numbers i.e. where the remainder is zero. ... Highest common factor (HCF) of 1651, 2032 is 127.

(i) Step 1 : choose bigger number : 2520>405

On dividing 2520 by 405 , we get

quotient = 6 , remainder = 90

⇒ 2520=(405×6)+90

Step 2 : On dividing 405 by 90 , we get

Quotient =4 and remanider= 45

⇒ 405=90×4+45

Step 3: On dividing 90 by 45 , we get

quotient = 2 and remainder = 0

⇒ 90=45×2+0

Step 4 : Since remainder is zero, stop the process

therefore , HCF of 405 and 2520 is 45.

Answer 2

Answer:

Euclid Division Lemma:-

a=bq+r,0≤r<b where a,b,q,r are integers