Prime is a simple little program that does the following:

1. Establishes a file ("Prime.odb") containing prime numbers in long 
integer format
2. Allows you to factorise integers up to 1 billion
3. Allows you to add ("seed") new primes into the file
4. Allows you to identify the "nth" prime (e.g. 2nd prime is 3, 10th 
is 29 etc)
5. Lists primes between two specified numbers

The more primes in prime.odb, the more complete the factorisation. 
A fully "primed" database is included. Just copy this to directory 
\Prime \ which the program creates when first run.

Put the file prime.opo in your normal \opo\ directory and start under 
RunOPL in the normal way. It will create "prime.odb" (if you didn't 
already put the supplied file in m:\prime\ manually).

You'll have the choice of factorising a number (with the subchoice of 
"seeding" more primes if the supplied number is higher than the highest 
prime in your file - if you don't seed, the program will do its best to
factorise based on the primes you already have in the file) OR 

Identifying the nth prime (if n is greater than the prime count in your 
file the program will print a continuous list until it reaches
the nth prime or until you hit a key to stop the listing) OR

Finally, you can list primes between two stated numbers. If the higher 
number you specify is higher than the highest prime in your file, the
program switched to calculation mode which (obviously) takes longer.

The supplied file contains primes up to 31991, sufficient to allow
factorisation of numbers up to 999999999.

This is freeware, only written for fun, but please let me know if 
anything doesn't work!

Peter Bennett

100025,1165