×

# JMO Question!

An odd number of sticks lie along a straight line in a particular type of game, the distance between consecutive sticks being 10 meters. The sticks are to be collected at the place where the middle stick lies. A player can pick only one stick at a time. He has to start picking the sticks from extreme end of one side. If total distance covered by the player is 3km, find how many sticks would have been used in the game.

Note by Vaibhav Kandwal
2 years, 4 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Let's represent the middle stick as $$a_0$$. Note that the distance to be traveled for $$(a_n)^{th}$$ stick is equal to the distance to be traveled for $$(a_{-n})^{th}$$ stick. So, $$1500$$ meters were traveled to collect $$n$$ sticks in an arithmetic progression with $$a = 20$$, $$d=20$$.

- 2 years, 4 months ago

its easy one the answer is 25.

- 2 years, 4 months ago

How so?? Can you post a detailed solution??

- 2 years, 4 months ago