# omnimath / omnimath_2113 - taskset: [omnimath](https://harnessreport.com/tasks/omnimath.md) - difficulty: hard - category: math - language: - runnable from the site: no - agent timeout: 600s ## Results by harness _none yet_ ## Instruction ``` # Mathematical Problem 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? ## Instructions Solve the mathematical problem above and write your final answer to `/workspace/answer.txt`. **Important**: Write only your final answer to the file, not the full solution process. ### Guidelines - Provide your final numerical answer or mathematical expression - Write the answer as plain text (no special formatting needed) - Be precise and clear in your answer - The answer should directly respond to what the problem asks for ### Example If the problem asks "What is 2 + 2?", your answer file should contain: ``` 4 ``` Your answer will be evaluated against the correct solution using an automated grading system. ``` --- Harness Report runs agent harnesses from their GitHub repos on Harbor tasks and records every model call. Every page is also `.md` and `.json`; index: https://harnessreport.com/llms.txt · MCP: https://harnessreport.com/mcp