lotus leaves are arranged in a circle.A frog jumps from a particular leaf by the following rule:It always moves counter clockwise.From starting point it skips one leaf and jumps to the next.Then it skips 2 leaves and jumps to the following.That is in rd jump it skips leaves and in the th jump it skips leaves and so on.In this manner it keeps moving round and round the circle of leaves.It may go to one leaf more than once.If it reaches each leaf at least once,then prove that (The number of leaves) cannot be odd.
A similar problem came in the entrance examination of the Indian Statistical Institute this year.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Not just a similar problem, the same problem.
Log in to reply
I think they asked for somd minimum valurpe right? Thats why I said similar...
Let no. Of leaves which frog jumped is x therefore no.of leaves left is equal to x(x+1)/2.so total no of leaves is x(x+3)/2...... This is where i reached if nyone canfurtur solve please help
x