The correct option is C 25
Let there be 2n+1 stones. So, there will be n stones each side of middle stone.
Suppose man started job from middle stone.
The distance covered for first stone =2×10 m
(as he has to go back to pick the stone and come back)
Distance covered for second stone =2×2×10 m
So, distance covering for one side is
=2×10+2×2×10+2×3×10+⋯+2×n×10
=2[10+2×10+3×10+⋯+n×10]
Same thing is repeated for the second side. So, same distance is cover for second side.
Since, man started job from one end,
Therefore, total distance covered is given by,
=4[10+2×10+3×10+...+n×10]−n×10
=40[1+2+3+...+n]−10n
=20n2+10n
But, the total distance covered =3 km=3000 m
∴20n2+10n=3000
⇒2n2+n−300=0
⇒(n−12)(2n+25)=0
⇒n=12
Hence, number of stones is 2n+1=25.