14 October 2008

Segments on a plane: problem

There are n white points and n black points on a plane. All are distinct and no three are on the same line. You must draw n segments, each between points of different colors. Segments must not intersect. (This also means they can't have a common endpoint.) Show that it's always possible to complete the task.

Send solutions to radugrigore at gmail. I'll post the list of solvers and a solution in a week. Please use the comments only to ask for clarifications, not to give the solution.

No comments:

Post a Comment

Note: (1) You need to have third-party cookies enabled in order to comment on Blogger. (2) Better to copy your comment before hitting publish/preview. Blogger sometimes eats comments on the first try, but the second works. Crazy Blogger.