Along a road lie an odd number of stones placed at intervals of 10 meter. These stones have to be assembled around the middle stone at a time. If a man starts from one of the end stones, and by carrying them in succession he covers 3 km to pile all stones at the center. Find the number of stones.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I only figured out the solution after entering 3 wrong answers...anyway, a diagram to illustrate this:
Log in to reply
Oh! Means you gave a nice try. @Ayush Rai your question is good!
Log in to reply
thanks!!!!!!
After figuring out and drawing this diagram, I wanted to write a solution, but I can't, because I didn't answer correctly
Log in to reply
@Hung Woei Neoh – that's funny!!
@Hung Woei Neoh – :( Thats a bad feeling isnt it? It has happened with me a lot of times. "Repeat many times" that phrase is somewhat funny XD.
Log in to reply
@Ashish Menon – I just realized that I have to answer a question correctly to post a solution
@Hung Woei Neoh – you put a diagram in your solution.that is good and may grab the attention of the viewers
good solution but there mistakes that you have done using latex.correct them
Log in to reply
Oh yes thanks! ⌣ ¨
Log in to reply
you're welcome
Log in to reply
@Ayush G Rai – The only problem while using continuous latex is that we must look into the whole part if there is any mistake :( and after I find out that I missed a minor thing like a ) or }, my head starts spinning. Thats the worst feeling.
Problem Loading...
Note Loading...
Set Loading...
Ok then consider a row of 2 n + 1 stones where A is the srone in the middle and there are n stones on the left and right of A . Now it is told that he starts from one end of the stones. Suppose he started from the right. Then first he will take the first stone of the RHS bring it to A and put it there. Then he will take the 2nd stone and bring it to A and drop it. He continues this till he collects all the stones on the right hand side of A . So, in doing this he covered a distance of twice the sum of the terms of the AP 1 0 , 2 0 , 3 0 , 4 0 , ⋯ , 1 0 ( n − 1 ) , 1 0 n but he has taken the first stone only once towards A. So, we have to subtract 10n from this. So, the total distance covered in carrying all the stones from the RHS is 1 0 n + 2 ( 1 0 + 2 0 + 3 0 + 4 0 + ⋯ + 1 0 ( n − 1 ) ) .
Now currently he is at A. Now he begins to collect all the stones on the LHS. He takes the first stone and come back to A, then the second one and come back to A, then the third, then the fourth and atlast the nth one. So, the total distance covered by him is twice the sum of the terms of the AP 1 0 , 2 0 , 3 0 , 4 0 , ⋯ 1 0 n . Nothing is subtracted here since he starts and ends at the same place i.e. A. So, the distance covered by him by collecting all stones of the LHS = 2 ( 1 0 + 2 0 + 3 0 + 4 0 + ⋯ + 1 0 n ) .
It is given that the total distance travelled is 3 k m = 3 0 0 0 m .
So,
1 0 n + 2 ( 1 0 + 2 0 + 3 0 + 4 0 + ⋯ + 1 0 ( n − 1 ) ) + 2 ( 1 0 + 2 0 + 3 0 + 4 0 + ⋯ + 1 0 n ) = 3 0 0 0 1 0 n + 2 ( 1 0 + 2 0 + 3 0 + 4 0 + ⋯ + 1 0 ( n − 1 ) ) + 2 × 1 0 n + 2 ( 1 0 + 2 0 + 3 0 + 4 0 + ⋯ + 1 0 ( n − 1 ) ) = 3 0 0 0 3 0 n + 4 ( 1 0 + 2 0 + 3 0 + 4 0 + ⋯ + 1 0 ( n − 1 ) ) = 3 0 0 0 3 0 n + 4 ( 2 n − 1 ( 1 0 + 1 0 ( n − 1 ) ) ) = 3 0 0 0 3 0 n + 4 ( 2 n − 1 ( 1 0 n ) ) = 3 0 0 0 3 0 n + 2 0 n ( n − 1 ) = 3 0 0 0 3 0 n + 2 0 n 2 − 2 0 n = 3 0 0 0 2 0 n 2 + 1 0 n − 3 0 0 0 = 0 1 0 ( 2 n 2 + n − 3 0 0 ) = 0 2 n 2 + n − 3 0 0 = 0 2 n 2 − 2 4 n + 2 5 n − 3 0 0 = 0 2 n ( n − 1 2 ) + 2 5 n ( n − 1 2 ) = 0 ( n − 1 2 ) ( 2 n + 2 5 ) = 0 n − 1 2 = 0 ( or ) 2 n + 2 5 = 0 n = 1 2 ( or ) n = 2 − 2 5
But number of stones cannot be negative, so, n = 2 − 2 5 . So, n = 1 2 .
∴ Number of stones = ( 2 n + 1 ) = ( 2 × 1 2 + 1 ) = 2 5 .