Q.In a potato race potatoes are placed in a line at intervals of metres with the first potato metres from the starting point. A contestant is required to bring the potatoes back to the starting place one at a time. How far would he run in bringing back all the potatoes?
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →The total distance is the sum of an arithmetic progression formed by the round-trip distances to each potato. The contestant runs 2480 metres.
Why this works
The problem is a classic application of arithmetic progressions in a real-world context. Each potato is at a fixed distance from the start, and the contestant must run to that potato and back — so each trip is a round trip of twice the one-way distance. The one-way distances themselves form an arithmetic progression: the first potato is 24 m away, the next is 28 m away (24 + 4), then 32 m, and so on. The total distance is simply the sum of all these round-trip distances.
The key insight: you don't need to simulate 20 trips. Once you recognise the pattern, you can use the sum formula for an AP.
Step-by-step solution
1. Find the one-way distance to each potato.
The first potato is 24 m from the start. Each subsequent potato is 4 m further. So the one-way distances (in metres) are:
This is an arithmetic progression with first term and common difference .
2. Find the distance to the 20th potato.
The th term of an AP is . For :
So the farthest potato is 100 m from the start.
3. Compute the total one-way distance for all 20 potatoes.
The sum of the first terms of an AP is:
Here , first term , last term :
…
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.