

                            Users Documention Guide
                               for: PRIME.EXE


-=HOW THE PROGRAM WORKS=-
When prime is run it asks the user to input an interger.  The number entered
must be no larger than 4,294,967,295 b/c of the normal limitations of the
C/C++ language.  The program responds by informing the user of the number's
primality ( it tells the user whether the number is prime or not ).


-=THE METHOD USED TO DETERMINE PRIME NUMBERS=-
The method used to determine whether the number is prime or not is a very
simple one.  This is the same method used in "PRIMLIST.EXE".
To explain this method I will need to simulate the program.  First, assume I
have a constant number.  We will call this number x.  The user is asked to
input x and the process begins from there.  After we have x we then find the
square root of x and we will call that squarex.  If x is prime, then it
cannot be evenly devided by any ot the intergers below or equal to squarex.
Therefore if we devide x by all the numbers below squarex and find that none
go into x evenly, then x is prime.  This is exactly what the program does.


-=HOW PRIME.EXE WAS WRITTEN=-
PRIME.EXE was written and compiled in MICROSOFT C++ (not c).  I believe it
follows the standard C/C++ language and is ANSI C/C++ compliant.  To gain
more insight into the program... try reading the commented source code
("PRIME.CPP").  If you would like more information or would like to contact
the author to offer suggestions, please feel free to do so!
You can reach me at:

Austin.C.J.Fowler@worldnet.att.net      (main address)
fone_phreak78@hotmail.com               (never read this mail)
HTTP://HOME.ATT.NET/~Austin.C.J.Fowler  (home page)
DALNET:  THe ICe_SurFer                 (irc registered screen name)
