[AccessD] Weekend fun: Primes

On 13 Dec 2005 at 21:54, Mark A Matte wrote:

> Gustav,
> 
> I still don't know why this intrigues me...but I found away around the
> 2,147,483,647 problem I was having...I got rid of the MOD function, just
> used division instead, and used Instr(1,RemainderTest,".") to see if the
> number had a decimal.
> 
> Not sure what I will do with this new knowledge...but I now know alot of
> large Prime numbers. Now that I have a db that will tell me if any number is
> prime...any suggestions, if any, of what to do with it?
> 

Any number?  In that case
Find the 43rd Mersenne Prime.  http://www.mersenne.org/prime.htm

Then go for the $10,000 prize for finding the first 10 million digit prime 
number.  http://www.eff.org/awards/coop.php




-- 
Stuart