benchmarks.wiki / Public workspace

Omni-MATH / Let n≥3 be a fixed integer. There are m≥n+1 beads on a circular necklace. You wish to paint the beads using n colors, such that among any n+1 consecutive beads every color appears …

Problem

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

problem

Let n≥3n\ge 3 be a fixed integer. There are m≥n+1m\ge n+1 beads on a circular necklace. You wish to paint the beads using nn colors, such that among any n+1n+1 consecutive beads every color appears at least once. Find the largest value of mm for which this task is $\emph{not}$ possible. [i]Carl Schildkraut, USA[/i]
Plain-text mathematical notation (without MathML)
Let n≥3 be a fixed integer. There are m≥n+1 beads on a circular necklace. You wish to paint the beads using n colors, such that among any n+1 consecutive beads every color appears at least once. Find the largest value of m for which this task is $\emph{not}$ possible.

[i]Carl Schildkraut, USA[/i]
Original LaTeX notation
Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible.

[i]Carl Schildkraut, USA[/i]

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