I was chasing links concerning the lack of tail recursion optimization in ruby and ran across a math problem:
Find the smallest positive integer n such that n % x = x-1 for x from 2 to 18
i.e. The remainder is one less than the divisor for all integral divisors from 2 to 18.

The [...]