Find the HCF of 15625 and 35 using Euclid Division Lemma
Answers
Answer:
your answer is 5
Step-by-step explanation:
This algorithm involves the operation of dividing and calculating remainders.
'a' and 'b' are the two positive integers, 'a' >= 'b'.
Divide 'a' by 'b' and get the remainder, 'r'.
If 'r' = 0, STOP. 'b' = the GCF (HCF, GCD) of 'a' and 'b'.
Else: Replace ('a' by 'b') & ('b' by 'r'). Return to the division step above.
Step 1. Divide the larger number by the smaller one:
15,625 ÷ 35 = 446 + 15;
Step 2. Divide the smaller number by the above operation's remainder:
35 ÷ 15 = 2 + 5;
Step 3. Divide the remainder from the step 1 by the remainder from the step 2:
15 ÷ 5 = 3 + 0;
At this step, the remainder is zero, so we stop:
5 is the number we were looking for, the last remainder that is not zero.
This is the greatest common factor (divisor).
Greatest (highest) common factor (divisor):
gcf, hcf, gcd (15,625; 35) = 5