Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10 5/3/83 based; site hou2h.UUCP Path: utzoo!watmath!clyde!burl!ulysses!mhuxl!houxm!hou2h!mr From: mr@hou2h.UUCP (M.RINDSBERG) Newsgroups: net.math,net.puzzles,net.games Subject: Re: a hard one!?!? Message-ID: <590@hou2h.UUCP> Date: Tue, 21-Aug-84 12:19:38 EDT Article-I.D.: hou2h.590 Posted: Tue Aug 21 12:19:38 1984 Date-Received: Wed, 22-Aug-84 01:40:47 EDT References: <595@bnl.UUCP> Organization: AT&T Bell Labs, Holmdel NJ Lines: 21 Here is a small program to find the number. Hard one ???????? #define MAXNUM 10000 main() { char a[MAXNUM]; int i, j; for(i = 0; i < MAXNUM; i++) a[i] = 0; for(j = 2; j <= 10; j++){ for(i = 0; i < MAXNUM; i++) if( i % j != j - 1) a[i] = 1; } for(i = 0; i < MAXNUM; i++) if(a[i] == 0){ printf("Number is %d\n",i); exit(0); } }