Re: [U2] Prime number file modulos

[Ron Hutchings]

You can shorten your prime search routine's execution by limiting the search 
for factors to the square root of the number being tested for primality.  If 
a number is composite(not prime) it has to have a factor smaller than its 
square root.
-------
u2-users mailing list
u2-users@listserver.u2ug.org
To unsubscribe please visit http://listserver.u2ug.org/