MathDB

On a circle there're

1000

marked points, each colored in one of

k

colors. It's known that among any

5

pairwise intersecting segments, endpoints of which are

10

distinct marked points, there're at least

3

segments, each of which has its endpoints colored in different colors. Determine the smallest possible value of

k

for which it's possible.

Problem Statement