Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 exptools 1/6/84; site ihuxa.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxl!ihnp4!ihuxa!trough
From: trough@ihuxa.UUCP (Chris Scussel)
Newsgroups: net.math,net.puzzle
Subject: More from the chain gang
Message-ID: <394@ihuxa.UUCP>
Date: Sun, 4-Mar-84 00:05:09 EST
Article-I.D.: ihuxa.394
Posted: Sun Mar  4 00:05:09 1984
Date-Received: Mon, 27-Feb-84 08:36:34 EST
Organization: AT&T Bell Labs, Naperville, IL
Lines: 19

OK, now we finally have a real answer to the chain puzzle (from Dave Seaman).
I was sorry to see that it stirred up such a fuss about infinite/indeterminant
distributions. I still maintain that the range of the relevant distribution
is not infinite, since "required lengths" larger than the original length
of the chain can't be obtained regardless of where the chain is cut. I was
also sorry to see the assumption of a particular distribution in order to obain
an answer. Shouldn't there still be a best answer even with no knowledge of the
distribution (possibly based on the assumption that all distributions are
equally likely; that should be amusing)? When I "guessed" a uniform distribution
I came up with same answer as Seaman: L/3. Interesting. Any takers on the n-piece
problem, or even the 3-piece one? Seems to be quite a bit more complicated.


					Chris Scussel
					Bell Labs
				AT&T Bell Laboratories (sorry!)
					Naperville, Illinois

			{AT&T BL}!ihnp4!ihuxa!trough