Q. Aand B are positive integers. HCF of Aand 630 is 210. HCF of B and ...
Euclid's Division Algorithm
Euclid's division algorithm is a method of finding the HCF of two numbers by repeated division and finding the remainder. The algorithm states that:
- Divide the larger number by the smaller number.
- Find the remainder.
- Divide the smaller number by the remainder.
- Repeat until the remainder is zero.
- The last non-zero remainder is the HCF of the two numbers.
Finding the HCF of A, 630, B, and 110
Given:
- HCF of A and 630 is 210.
- HCF of B and 110 is 55.
We can use Euclid's division algorithm to find the HCF of A, 630, B, and 110.
Step 1: Finding the HCF of A and 630
Since the HCF of A and 630 is 210, we can use Euclid's division algorithm to find the HCF of 210 and 630.
Dividend |
Divisor |
Quotient |
Remainder |
---|
630 |
210 |
3 |
0 |
Therefore, the HCF of A and 630 is 210.
Step 2: Finding the HCF of B and 110
Since the HCF of B and 110 is 55, we can use Euclid's division algorithm to find the HCF of 55 and 110.
Dividend |
Divisor |
Quotient |
Remainder |
---|
110 |
55 |
2 |
0 |
Therefore, the HCF of B and 110 is 55.
Step 3: Finding the HCF of A, 630, B, and 110
Now, we can use Euclid's division algorithm to find the HCF of 210, 630, 55, and 110.
Dividend |
Divisor |
Quotient |
Remainder |
---|
630 |
210 |
3 |
0 |
|