Consider an infinite sequence of positions 1, 2, 3, . . . and suppose we have...

90.2K

Verified Solution

Question

Advance Math

Consider an infinite sequence of positions 1, 2, 3, . . . andsuppose we have a stone at position 1 and another stone at position2. In each step, we choose one of the stones and move it accordingto the following rule: Say we decide to move the stone at positioni; if the other stone is not at any of the positions i + 1, i + 2,. . . , 2i, then it goes to 2i, otherwise it goes to 2i + 1.

For example, in the first step, if we move the stone at position1, it will go to 3 and if we move the stone at position 2 it willgo to 4. Note that, no matter how we move the stones, they willnever be at the same position.

Use induction to prove that, for any givenpositive integer n, it is possible to move one of the stones toposition n. For example, if n = 7 first we move the stone atposition 1 to 3. Then, we move the stone at position 2 to 5Finally, we move the stone at position 3 to 7.

Answer & Explanation Solved by verified expert
3.8 Ratings (538 Votes)
IF YOU HAVE ANY DOUBTS COMMENT BELOW I WILL BE    See Answer
Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:
  • Unlimited Question Access with detailed Answers
  • Zin AI - 3 Million Words
  • 10 Dall-E 3 Images
  • 20 Plot Generations
  • Conversation with Dialogue Memory
  • No Ads, Ever!
  • Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
Become a Member

Other questions asked by students