\(n(>1)\) 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 \(3\)rd jump it skips \(3\) leaves and in the \(4\)th jump it skips \(4\) 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 \(n\)(The number of leaves) cannot be odd.

\(\textbf{Note:}\)A similar problem came in the entrance examination of the Indian Statistical Institute this year.

## Comments

Sort by:

TopNewestNot just a similar problem, the

sameproblem. – Paramjit Singh · 2 years, 11 months agoLog in to reply

– Eddie The Head · 2 years, 11 months ago

I think they asked for somd minimum valurpe right? Thats why I said similar...Log in to reply

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 – Pratyush Khandelwal · 2 years, 11 months ago

Log in to reply

x – Brennan Baller · 5 months, 1 week ago

Log in to reply