benchmarks.wiki / Public workspace

Omni-MATH / Let m and n be positive integers. A circular necklace contains mn beads, each either red or blue. It turned out that no matter how the necklace was cut into m blocks of n consecuti…

Problem

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

problem

Let mm and nn be positive integers. A circular necklace contains mnmn beads, each either red or blue. It turned out that no matter how the necklace was cut into mm blocks of nn consecutive beads, each block had a distinct number of red beads. Determine, with proof, all possible values of the ordered pair (m,n)(m, n).
Plain-text mathematical notation (without MathML)
Let m and n be positive integers. A circular necklace contains mn beads, each either red or blue. It turned out that no matter how the necklace was cut into m blocks of n consecutive beads, each block had a distinct number of red beads. Determine, with proof, all possible values of the ordered pair (m,n).
Original LaTeX notation
Let $m$ and $n$ be positive integers. A circular necklace contains $mn$ beads, each either red or blue. It turned out that no matter how the necklace was cut into $m$ blocks of $n$ consecutive beads, each block had a distinct number of red beads. Determine, with proof, all possible values of the ordered pair $(m, n)$.

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

Official source

initial import