benchmarks.wiki / Public workspace

Omni-MATH / Suppose there are 100 cookies arranged in a circle, and 53 of them are chocolate…

Problem

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

problem

Suppose there are 100 cookies arranged in a circle, and 53 of them are chocolate chip, with the remainder being oatmeal. Pearl wants to choose a contiguous subsegment of exactly 67 cookies and wants this subsegment to have exactly kk chocolate chip cookies. Find the sum of the kk for which Pearl is guaranteed to succeed regardless of how the cookies are arranged.
Plain-text mathematical notation (without MathML)
Suppose there are 100 cookies arranged in a circle, and 53 of them are chocolate chip, with the remainder being oatmeal. Pearl wants to choose a contiguous subsegment of exactly 67 cookies and wants this subsegment to have exactly k chocolate chip cookies. Find the sum of the k for which Pearl is guaranteed to succeed regardless of how the cookies are arranged.
Original LaTeX notation
Suppose there are 100 cookies arranged in a circle, and 53 of them are chocolate chip, with the remainder being oatmeal. Pearl wants to choose a contiguous subsegment of exactly 67 cookies and wants this subsegment to have exactly \(k\) chocolate chip cookies. Find the sum of the \(k\) for which Pearl is guaranteed to succeed regardless of how the cookies are arranged.

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