From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,f856693efe5e5bdb
X-Google-Attributes: gid103376,public
From: Geert Bosch <geert@gonzo.sun3.iaf.nl>
Subject: Re: Prime Number Algorithm Needed
Date: 1997/11/22
Message-ID: <655fkp$1hi$1@gonzo.sun3.iaf.nl>#1/1
X-Deja-AN: 291370503
References: <6548v3$ocm$1@news1.bu.edu>
Organization: La Calandre Infortunee
Newsgroups: comp.lang.ada
Date: 1997-11-22T00:00:00+00:00
List-Id: <comp.lang.ada>


Thomas Dauria <tdauria@bu.edu> wrote:
   I am looking for a good prime number algorithm.  The
   user would be entering a number and I would need to find
   the next prime greater than or equal to this user
   entered number.

Actually now I think about it, this would be a really neat
simple exercise for somebody starting with an introductory 
course on programming.

Of course, if your goal is not learning the language, but rather 
finding those nasty prime numbers I would suggest using one of 
those fine prime number applications that already exist. With 
all the fuss about encryption lately, they are becoming 
increasingly popular. 

A good binary version for DOS, OS/2 and Linux is at 
   http://www.leo.org/pub/comp/platforms/pc/msdos/apps/maths/prime13.zip

Regards,
   Geert