home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: rec.puzzles
- Path: sparky!uunet!UB.com!pacbell.com!decwrl!elroy.jpl.nasa.gov!swrinde!gatech!udel!darwin.sura.net!newsserver.jvnc.net!yale.edu!ira.uka.de!math.fu-berlin.de!mailgzrz.TU-Berlin.DE!news.netmbx.de!Germany.EU.net!mcsun!sunic!aun.uninett.no!nuug!nntp.nta.no!hal.nta.no!stein
- From: stein@hal.nta.no (Stein Kulseth)
- Subject: Re: 21-link chain puzzle (SPOILER)
- Message-ID: <1993Jan27.073631.13494@nntp.nta.no>
- Sender: news@nntp.nta.no
- Nntp-Posting-Host: elvis.nta.no
- Organization: Norwegian Telecom Research
- References: <1993Jan16.221610.12819@spartan.ac.BrockU.CA> <727631103.12214@minster.york.ac.uk>
- Date: Wed, 27 Jan 93 07:36:31 GMT
- Lines: 30
-
- In article <727631103.12214@minster.york.ac.uk>, sjbuckle@minster.york.ac.uk writes:
- |> Darcy Boese (dboese@spartan.ac.BrockU.CA) wrote:
- |> >The other solution is this:
- |> >
- |> >1 1 3 5 11
- |> >
- |> >(yours was 1 1 3 6 10)
- |>
- |> Surely there's also: 1 2 4 6 8.
- |> Use 1,2,4,8 to make all numbers up to 15.
- |> Then repeat how you made up 10-15 and throw in the 6 as well, to get 16-21.
-
- How would you break links to make a 1 2 4 6 8 partition of the chain?
- Look at this, here's a graphical representation of the 1 1 3 5 11 solution:
-
- OOO C OOOOO C OOOOOOOOOOO
- (where Os are chained unbroken links, and the Cs are the unchained broken links)
-
- And equivalently:
-
- OOO C OOOOOO C OOOOOOOOOO
-
- For each break you get a single link. Your solution has only one single
- link, yet the rest of the chain is broken into 4 pieces.
-
- --
- stein.kulseth@nta.no (Norwegian Telecom Research)
- 'When murders are committed by mathematics, they can be solved by
- mathematics. Most of them aren't, and this one wasn't'
- - Nick Charles (Dashiell Hammett's "The Thin Man")
-