🚀 go-pugleaf

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")