[net.math] Solution to remainder problem

js2j@mhuxt.UUCP (sonntag) (08/20/84)

Problem: Find the least number, N, such that the remainder of N/a[n] is
a[n] - 1 for a[n] = (2,3,4 ... 9,10).

Solution: one less than the least common multiple of all of the a[n]'s.

Proof:

This is left as an exercise for the reader.

After all, I'm an engineer, not a mathematician.  I don't do proofs.

Jeff Sonntag
ihnp4!mhuxl!mhuxt!js2j