![]() Copyright ©1997 by Paul Niquette. All
rights reserved. |
![]() First, let us review the original
puzzle. The limerick provided the clues shown below.
The solution was straight forward using the method
described in the Next Number
puzzle. In the format of these tables, the
subtractions of adjacent numbers produce the entries
immediately higher up. The sophisticated solver assumes that
the top-most difference -- 6 in this case -- prevails
for the whole table. He or she then performs indicated
additions to produce the entries immediately below
until the requisite numbers are revealed in the
bottom-most row.
One might suppose that the king
assumed that there was only one solution and it was
elementary indeed: the king's tormentor would notice
immediately that (666 - 1)/7 = 95, thus by
merely adding 95 to entries in the series for
each step, one readily fills in the missing numbers...
Thus the king's tormentor would
receive his reward and rule the Land of Puzzles for
just one day, and that would be that. But one might
also suppose that the king's tormentor had something
else in mind: To rule the Land of Puzzles for more
than one day. The 'linear' solution above
is only one of a kind. Whereas any old numbers
might be inserted in the series, a vital question must
answered: "What is the rationale for those
numbers? All of them.
First, assume some value (10 instead of 6, say) for the common difference and fill in the top-most row of the table. Starting at the right-most column, the sophisticated solver sees that the top and bottom entries are already determined, leaving only two differences to be inserted into the table. He or she makes a guess (31 and 138, say) for each of them, then calculates backwards filling in the table entries until the left-most entry is determined. Almost certainly, it will not have the required value of one. Having a computer with a spreadsheet program sure helps. The case indicated below used a common
difference of 10 and, through trial-and-error,
the other two numbers were re-computed a few times
until that appeared as the
first number in the series. Here's how the process
would look...
Start with the known solution to the original limerick. That provides a basis for choosing those two numbers in the right-most column (31 and 138). After all, we have a pair that we know will produce a over in the left-most position, specifically 47 and 206. With some experimenting, it turns out that another combination which works is 45 and 200. A whole family of solutions can be generated by simply adding and subtracting 2 and 6 to the respective differences in the right-most column and working the table from right to left to produce all the intervening numbers.
|