benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / 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…

Problem

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

problem

A binary string of length nn is a sequence of nn 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.
Plain-text mathematical notation (without MathML)
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.
Original LaTeX notation
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.

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
8f57c583-6f9b-59e1-b639-0944abbb7f1b
task_key
test--8f57c583-6f9b-59e1-b639-0944abbb7f1b
task_revision_id
1
config / split
/ test

Official source

initial import