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

Home > Just Math
Spacy colors (Posted on 2006-08-25) Difficulty: 4 of 5
Every point in 3D-space is colored either red, green or blue. Let R (resp. G and B) be the set of distances between red (resp. green and blue) points. Prove that at least one of R, G, or B, consists of all the non-negative real numbers.

See The Solution Submitted by JLo    
Rating: 4.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: treja vu - solution | Comment 3 of 10 |
(In reply to treja vu - solution by Leming)

If for x=1, all the vertices are red, and for x=2 all the vertices are blue? There may well be other tetrahedra with other colors, as would be required if the conjecture is true, but two or more points of the same color on one tetrahedron doesn't prove what's sought here.
  Posted by Charlie on 2006-08-25 15:58:03

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