home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!pipex!unipalm!uknet!pavo.csi.cam.ac.uk!camcus!cet1
- From: cet1@cus.cam.ac.uk (C.E. Thompson)
- Newsgroups: sci.math
- Subject: Re: The problem of Irish men
- Message-ID: <1992Oct15.215210.11811@infodev.cam.ac.uk>
- Date: 15 Oct 92 21:52:10 GMT
- References: <1992Oct15.063757.4956@noose.ecn.purdue.edu> <1992Oct15.111727.11840@cs.tcd.ie> <israel.719166972@unixg.ubc.ca>
- Sender: news@infodev.cam.ac.uk (USENET news)
- Organization: U of Cambridge, England
- Lines: 23
- Nntp-Posting-Host: grus.cus.cam.ac.uk
-
- In article <israel.719166972@unixg.ubc.ca>, israel@unixg.ubc.ca
- (Robert B. Israel) writes:
- |>
- |> Perhaps what Surya meant was:
- |> there are at least two Irish men who shook hands with the same
- |> number of other Irish men.
- |> (i.e. multiple shakes with the same man don't count).
-
- You must exclude loops as well as multiple edges: it doesn't count to shake
- hands with yourself. (We would have had less quibbling if the problem had
- been about the Belgians rather than the Irish, wouldn't we?)
-
- |> Actually you have to add another clarification
- |> [...]
- |>
- |> Once you do this, it's an easy application of the Pigeonhole Principle.
-
- Easy, but not absolutely trivial. You have to observe that orders 0 and N-1
- cannot coexist.
-
- Chris Thompson
- JANET: cet1@uk.ac.cam.phx
- Internet: cet1@phx.cam.ac.uk
-