2009 OIM Problems/Problem 6

Revision as of 15:25, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == Around a circle, 6000 points are marked and each one is colored with one of 10 given colors, such that among any 100 consecutive points the 10 colors always appe...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Around a circle, 6000 points are marked and each one is colored with one of 10 given colors, such that among any 100 consecutive points the 10 colors always appear. Find the smallest value $k$ with the following property: For all coloration of this type there are $k$ consecutive points among which the 10 colors appear.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions