Had to make a side trip at work today, so I dropped off a micro at
this interesting little location. I have been by it many times and
have been meaning to stop, but never made the time.
The cache is simple, so we must make it a tad harder with a
little math problem. I loved math in school, didn't you? Here is
the problem:
Find a number consisting of 9 digits in which each of the digits
from 1 to 9 appears only once. This number should satisfy the
following requirements:
a. The number should be divisible by 9.
b. If the most right digit is removed, the remaining number should
be divisible by 8.
c. If then again the most right digit is removed, the remaining
number should be divisible by 7.
d. etc. until the last remaining number of one digit which should
be divisible by 1.
Now you have this 9 digit number, with all the digits 1-9. From
the left, label each digit A thru I. Your coordinates will be N FH
0F.IEE W GG CE.EDD
Have Fun!
