# omnimath / omnimath_685 - 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 A binary string of length $n$ is a sequence of $n$ digits, each of which is 0 or 1 . The distance between two binary strings of the same length is the number of positions in which they disagree; for example, the distance between the strings 01101011 and 00101110 is 3 since they differ in the second, sixth, and eighth positions. Find as many binary strings of length 8 as you can, such that the distance between any two of them is at least 3 . You get one point per string. ## 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