Question

find HCF of 625, 3125 and 15625 by suing Euclid division algorithm


step by step explaination needed handwritten will be best ​

Answer 1

Answer:

Finding the HCF of 625 and third number 15625 by applying Euclid's division lemma. Now, the remainder at this stage is zero. So the divisor i.e., 625 at this stage is the HCF of 625 and 15625. Hence, HCF of (626, 3127, 15628) is 625.

Answer 2

Answer:

hcf 625

Step-by-step explanation:

minimum difference falue of two no is 3125-625= 2500

factor of 2500 is = 1250,625,500,250,125,100,50,25,20,10,5,4,2

now we see that , 625 is the largest factor of 2500 which is completely divide the all three no.

thus the ans is 625

or

divided by minimum number.

first divide 3125 by 625. here 3125 is completely divisible by 625.

2n take this divisor 625 and divide 15625. and here 15625 is completely divisible by 625.

that means 625 is the largest number which is completely divide all three no. so the ans is 625