Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site mhuxt.UUCP Path: utzoo!watmath!clyde!burl!ulysses!mhuxl!mhuxt!js2j From: js2j@mhuxt.UUCP (sonntag) Newsgroups: net.math Subject: Solution to remainder problem Message-ID: <243@mhuxt.UUCP> Date: Mon, 20-Aug-84 16:34:58 EDT Article-I.D.: mhuxt.243 Posted: Mon Aug 20 16:34:58 1984 Date-Received: Tue, 21-Aug-84 00:37:54 EDT Distribution: net Organization: AT&T Bell Laboratories, Murray Hill Lines: 13 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