Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sdd.hp.com!spool.mu.edu!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!mcsun!hp4nl!mhres!asacsg!kr
From: kr@asacsg.mh.nl (Koos Remigius)
Newsgroups: comp.sys.mac.programmer
Subject: Prime numbers, Help
Message-ID: <1991Apr4.164338.329@asacsg.mh.nl>
Date: 4 Apr 91 16:43:38 GMT
Article-I.D.: asacsg.1991Apr4.164338.329
Organization: ASAC Nederland b.v.
Lines: 25

Hello,

Is there someone out there who has a little routine, in LightSpeed Pascal, that
gives me the first prime number larger then the number given to the routine.

Example:

I call the routine as follows:

	Primenumber:=GetNextPrime(22654);

The routine GetNextPrime should give me a prime number, as close as 
possible, but larger then the passed number.

Or any prime number generator routine is also welcome.

Cheers,

	Koos Remigius

-- 
Koos Remigius			      kr@mh.nl via internet backbones
Asac Nederland B.V	              uucp: ..!{uunet,hp4nl}!mh.nl!kr
Coenecoop 7, 2741 PG Waddinxveen,  The Netherlands
---------------- "Still crazy after all these years" ----------------