Question

Euclid's Division Algorithm
Using Euclids division algorithm find the HCF of 405 and 2520.​

Answer 1

Step-by-step explanation:

hope it will help u ....

Answer 2

Given :

• 2520 and 405

To find :

• HCF of 2520 and 405 by Euclid's division algorithm =?

Step-by-step explanation:

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 ,

Start with a larger integer , that is 2520,

Applying the Euclid's division lemma to 2520 and 405, we get

2520 = 405 x 6 + 90

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

405 = 90 x 4 + 45

We consider the new divisor 90 and remainder 45 and apply the division lemma to get

90 = 45 x 2 + 0

Now, the remainder at this stage is 0.

So, the divisor at this stage, i.e, 45 is the HCF of 2520 and 405.