Re: Large number testing
- --- On Mon, 7/21/08, dkandadai <dkandadai@...> wrote:
> I am inteested in knowing how very large prime suspects i.e.Pollard's Rho is a factor-finding algorithm. It is impractical
> larger than the capabality of Pollard's rho test, are tested;
> is it more of a probabality test?
to use it as a primality test. For information on primality tests,
just see http://primepages.org/ .