benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Rachel has two indistinguishable tokens, and places them on the first and second…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Rachel has two indistinguishable tokens, and places them on the first and second square of a 1×61 \times 6 grid of squares. She can move the pieces in two ways: If a token has a free square in front of it, then she can move this token one square to the right. If the square immediately to the right of a token is occupied by the other token, then she can 'leapfrog' the first token; she moves the first token two squares to the right, over the other token, so that it is on the square immediately to the right of the other token. If a token reaches the 6th square, then it cannot move forward any more, and Rachel must move the other one until it reaches the 5th square. How many different sequences of moves for the tokens can Rachel make so that the two tokens end up on the 5th square and the 6th square?
Plain-text mathematical notation (without MathML)
Rachel has two indistinguishable tokens, and places them on the first and second square of a 1×6 grid of squares. She can move the pieces in two ways: If a token has a free square in front of it, then she can move this token one square to the right. If the square immediately to the right of a token is occupied by the other token, then she can 'leapfrog' the first token; she moves the first token two squares to the right, over the other token, so that it is on the square immediately to the right of the other token. If a token reaches the 6th square, then it cannot move forward any more, and Rachel must move the other one until it reaches the 5th square. How many different sequences of moves for the tokens can Rachel make so that the two tokens end up on the 5th square and the 6th square?
Original LaTeX notation
Rachel has two indistinguishable tokens, and places them on the first and second square of a $1 \times 6$ grid of squares. She can move the pieces in two ways: If a token has a free square in front of it, then she can move this token one square to the right. If the square immediately to the right of a token is occupied by the other token, then she can 'leapfrog' the first token; she moves the first token two squares to the right, over the other token, so that it is on the square immediately to the right of the other token. If a token reaches the 6th square, then it cannot move forward any more, and Rachel must move the other one until it reaches the 5th square. How many different sequences of moves for the tokens can Rachel make so that the two tokens end up on the 5th square and the 6th square?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
a41fedf1-2d66-580b-9be1-6e3e86173fbe
task_key
test--a41fedf1-2d66-580b-9be1-6e3e86173fbe
task_revision_id
1
config / split
/ test

Official source

initial import