The LCM? The GCD? I'm told some people substitute GCF for GCD. Since the GFC I haven't needed to know such things, but in order to meet the needs of paperless cachers with smaller and smaller screens it is best to keep your cache descriptions concise.
So on that note, what is the smallest number that:
when divided by 10 has a remainder of 9,
when divided by 9 has a remainder of 8,
when divided by 8 has a remainder of 7,
when divided by 7 has a remainder of 6,
when divided by 6 has a remainder of 5,
when divided by 5 has a remainder of 4,
when divided by 4 has a remainder of 3,
when divided by 3 has a remainder of 2,
when divided by 2 has a remainder of 1, and
when divided by 1 has a remainder of 0?
Finding the least common multiple (LCM) of the divisors and remainders will yield the singular number you need to solve the cache. It's a rather interesting number which will take you to a reasonably interesting location. Perhaps not as grand as some but there is granite and some great views all the same.
