From: rgep@pmms.cam.ac.uk (Richard Pinch)
Newsgroups: sci.math
Subject: Re: HELP PLS. PRIME NUMBER?
Date: 21 Aug 1996 13:41:30 GMT

In article <01bb8ef0$539cc9a0$2bac399d@v-cnadc1>, 
"Dann Corbit" <a-cnadc@microsoft.com> writes:
|> Brute force method:
|> 
|> For a given integer n, to prove it is prime
|> prove that it cannot be divided without
|> remainder for any number ( besides 1 ) 
|> up to the floor of the square root of n.
|> 
|> Reggie Choo <ru2bz4me@singnet.com.sg> wrote in article
|> <3219C73F.9BD@singnet.com.sg>...
|> > Can someone teach me how to prove that a prime number is
|> > a prime number?

There is a survey of some rather more sophisticated methods at

	http://www.dpmms.cam.ac.uk/~rgep/publish.html#42

Richard Pinch;	Queens' College, Cambridge