Another Bump :
n ( 1) lotus leafs are arranged in a circle. A frog jumps from a particular leaf by the following rule: It always moves clockwise. From staring point it skips 1 leaf and jumps to the next. Then it skips 2 leaves and jumps to the following. That is in the 3rd jump it skips 3 leaves and 4th 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.

Question

Another Bump :
n (> 1) lotus leafs are arranged in a circle. A frog jumps from a particular leaf by the following rule: It always moves clockwise. From staring point it skips 1 leaf and jumps to the next. Then it skips 2 leaves and jumps to the following. That is in the 3rd jump it skips 3 leaves and 4th 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.

miracrown · Answer

Yes, it's sort of an interesting problem. I am thinking how to construct it. Are you familiar with sequences?

shubhamsrg · Answer

I am familiar with sequences.

miracrown · Answer

we may be able to avoid a direct technical treatment of sequences by just making some intuitive arguments about the numbers of the leafs the frog touches or some such If that's what you're getting at
But I mean we're talking about a sequence here
I would like to draw a graphical representation of the situation...

miracrown · Answer

|dw:1400401782497:dw|