$10K coding deathmatch

[Andy Bradford]

Thus said Shane Hathaway on Thu, 02 Nov 2006 16:34:45 MST:

> Josh's explanation is mathematically precise and concise, but not easy
> to grasp  without reading it  over a  couple of times.  Some imprecise
> inference often helps.

So, unless  I'm reading my Python  code incorrectly, it would  appear that
I'm not the  only one that misinterpreted which sequence  should be used
when making the comparision.

The results of the Python versions sent to this list match what my first
revision of the program output:

5 3 2 -4
not a match
2 1 2 4 7
not a match
-3 2 1 4 3 3 6
not a match
3 4 6 7 3 4 5 12 14 -4 -9 -18 5 22 41 43 29 17 -2 7 19 22 23 24
not a match
3 9
not a match

This is because  the ``sequence'' was the original  sequence of numbers,
not the sequence of numbers defined by { 1 ... n-1 }.

Andy
--
[-----------[system uptime]--------------------------------------------]
  5:16pm  up 4 days,  7:01,  1 user,  load average: 1.00, 1.00, 1.00