Question

Himadri has a collection of 625 Indian postal stumps and 325 International postal stumps. She wants to display them in identical groups of Indian and International stumps with no stump left out. What is the greatest number of groups Himadri can display the stamp

$vo \: case \: to \: apka \: hai$
​

Answer 1

Answer:

25

Explanation:

find HCF  of 625 and 325 by Euclid devision lemma

 => 625=325*1+300

=> 325=300*1+25

=> 300=25*12+0

H.c.f =25

Therefore,25 numbers of groups himadri can display the stumps.