So let's ask the heavy hitters on this forum. How does the TCL verb PRIME do
its magic.

Thanks in advance.
----- Original Message -----
From: "Ron Hutchings" <[EMAIL PROTECTED]>
To: <[email protected]>
Sent: Saturday, September 03, 2005 12:41 PM
Subject: Re: [U2] Prime number file modulos


> 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
> [email protected]
> To unsubscribe please visit http://listserver.u2ug.org/
-------
u2-users mailing list
[email protected]
To unsubscribe please visit http://listserver.u2ug.org/

Reply via email to