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.
(In reply to
Solution (Some details required) by Bractals)
"Colorless" points are giving me a problem understanding you. The
problem statement says every point is colored, so where are these
colorless points coming from?
|
Posted by Richard
on 2006-08-27 16:06:19 |