🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: rec.puzzles
Article #2645

Re: An(other) *easy* puzzle.

#2645
From: Richard Harter
Date: Sun, 10 Jan 1993 04:33
51 lines
2418 bytes
In article <1993Jan9.163703.24700@zip.eecs.umich.edu> kanad@quip.eecs.umich.edu (Kanad Chakraborty) writes:

>>A plane is totally colored with two colors.
>>* Show that there exist three points of same color that
>>  (when connected) form an equilateral triangle.

>Proof. WLOG, let the colors be red and blue.
>Choose a point A in the colored plane. Suppose, WLOG, that 
>A is colored blue. Find the (or a) point colored red _nearest_ to A 
>(Euclidean distance-wise). (This is always possible because both
>colors have been used.)

Stop there.  The assertion is false.  For a counter example, color all
points with rational coordinates red and those with irrational coordinates
blue.

For a simple proof, consider this figure (equilateral triangular net);:

                 0
                1 2
               3 4 5
              6 7 8 9

This figure contains a same-colored equilateral triangle.  Proof:
Suppose it does not.   Then 1-5-7 contains both colors; one is the same
as the color of 4.  Without loss of generality we can suppose that 1 and
4 are red and that at least one of 5 and 7 are blue, which gives us:


                 0
                R 2
               3 R 5
              6 7 8 9

Then it follows that 2 and 3 must be blue and, to keep 2-3-8 multi-colored,
8 must be red.  In turn this implies that 5 and 7 are both blue, giving us

                 0
                R B
               B R B
              6 B R 9

Now from triangle 3-6-7 6 must be R, from triangle 2-7-9 9 must be R,
and from 0-3-5 0 must be R, so that 0-6-9 is all R, contrary to the
assumption.  Q.E.D.

-- 
Richard Harter: SMDS Inc.  Net address: rh@smds.com Phone: 508-369-7398 
US Mail: SMDS Inc., PO Box 555, Concord MA 01742.    Fax: 508-369-8272
In the fields of Hell where the grass grows high
Are the graves of dreams allowed to die.
Technical Details
Message-ID: <1993Jan10.043342.24730@smds.com>
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!uwm.edu!caen!nic.umass.edu!m2c!crackers!jjmhome!smds!rh
References: <1993Jan8.193314.3289@zip.eecs.umich.edu> <1993Jan9.030824.13624@Csli.Stanford.EDU> <1993Jan9.163703.24700@zip.eecs.umich.edu>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!uwm.edu!caen!nic.umass.edu!m2c!crackers!jjmhome!smds!rh
From: rh@smds.com (Richard Harter)
Newsgroups: rec.puzzles
Subject: Re: An(other) *easy* puzzle.
Message-ID: <1993Jan10.043342.24730@smds.com>
Date: 10 Jan 93 04:33:42 GMT
References: <1993Jan8.193314.3289@zip.eecs.umich.edu> <1993Jan9.030824.13624@Csli.Stanford.EDU> <1993Jan9.163703.24700@zip.eecs.umich.edu>
Reply-To: rh@ishmael.UUCP (Richard Harter)
Organization: Software Maintenance & Development Systems, Inc.
Lines: 51