home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!usc!sdd.hp.com!spool.mu.edu!agate!stanford.edu!rock!concert!unccsun.uncc.edu!ws72!sbardhan
- From: sbardhan@uncc.edu (Soumendu Bardhan)
- Subject: Re: Interesting Discrete Math Question
- Message-ID: <BzFMMs.D86@unccsun.uncc.edu>
- Sender: usenet@unccsun.uncc.edu
- Nntp-Posting-Host: ws72.uncc.edu
- Reply-To: sbardhan@uncc.edu
- Organization: University of NC at Charlotte
- References: <1992Dec17.205217.2719@parc.xerox.com>
- Date: Fri, 18 Dec 1992 01:54:28 GMT
- Lines: 24
-
- Ken writes:
-
- This is all well and fine, except, how do you know you've found the best partition
- of those integers? That is, how do you know there isn't some other partition Q =
- {q_1, q_2, ... q_n} of the numbers 1-100 such that
-
- (i) for all i, j, and for all a in q_i, b in q_j, |a - b| != 3; and
- (ii) n > 51?
-
- I bring this up since someone else answered 51, having found a way to choose 50
- elements before guaranteeing that two would be 3 apart. At first blush that
- seemed plausible, until others got a little more clever. Is
-
- 1 2 3, 7 8 9, ....., 97 98 99
-
- as clever as we need to be?
-
- For the record, I believe so (QED :-)).
-
- I think this is what makes mathematics different from other subjects,
- Great mathematicians have discovered famous theories and numbers
- without even leaving a clue to us regarding how they got it;
- May be they themselves could not realize it.
-
-