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

Home > Shapes > Geometry
2 Colors 2 (Posted on 2003-08-25) Difficulty: 4 of 5
Suppose you have an infinite plane, and each point on the plane has been arbitrarily painted one of two colors.

Prove that there exists an equilateral triangle whose vertices are all the same color.

What is the fewest number of points needed to prove this?

See The Solution Submitted by DJ    
Rating: 4.3684 (19 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: 5-point proof | Comment 4 of 14 |
(In reply to 5-point proof by Bryan)

Brian
I believe that the problem is asking for the fewest number of points so that no matter how you rearrange the colors you will always have an equilateral triangle with all of the same color points. If you place the two different colors in different positions but still keeping the five points you have there isn't an equilateral triangle meeting the condition. For example you can rearrange them like this:
r
b r b
r
There is no equilateral triangle meeting the conditions in this arrangement.
  Posted by Kelsey on 2003-08-26 15:29:18

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

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