Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site mouton.UUCP Path: utzoo!watmath!clyde!burl!ulysses!allegra!mouton!mwg From: mwg@mouton.UUCP Newsgroups: net.math,net.puzzles,net.games Subject: Re: a hard one!?!? (solution to remainder problem) Message-ID: <130@mouton.UUCP> Date: Mon, 20-Aug-84 09:50:37 EDT Article-I.D.: mouton.130 Posted: Mon Aug 20 09:50:37 1984 Date-Received: Tue, 21-Aug-84 00:14:53 EDT References: <595@bnl.UUCP> Organization: AT&T Bell Laboratories, Murray Hill Lines: 6 ++ Problem: Find N s.t. N/m yields a remainder of m-1 for All m in [2,10]. Solution: N+1 must be a multiple of all integers in [2..10], so N+1 = 2*2*2*3*3*5*7 -> N = 2519.