All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
No crossing (Posted on 2017-02-11) Difficulty: 3 of 5
Some 2n points in the plane are chosen so that no three are collinear, and then half are colored red and half blue.

Will it always be possible to connect every red point with a blue one so that none of the connecting lines intersect?

Please justify your answer.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
There are no comments yet.
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information