Question

find HCF using Euclid 's division lemma. A) ( 250 , 450 )

Answer 1

Answer:

answer is above i hope you can understand

Answer 2

Euclid's division lemma :

Let a and b be any two positive Integers .

Then there exist two unique whole numbers q and r such that

a = bq + r ,

0 ≤ r <b

Now ,

Clearly, 450 > 250

Start with a larger integer , that is 450.

Applying the Euclid's division lemma to 450 and 250, we get

450 = 250 × 1 + 200

Since the remainder 200 ≠ 0, we apply the Euclid's division lemma to divisor 250 and remainder 200 to get

250 = 200 × 1 + 50

We consider the new divisor 200 and remainder 50 and apply the division lemma to get

200 = 50 × 4 + 0

Now, the remainder at this stage is 0.

So, the divisor at this stage, ie, 50 is the HCF of 450 and 250.