Re: Surrogate factoring works very well
- From: rossum <rossum48@xxxxxxxxxxxx>
- Date: Wed, 21 Mar 2007 23:33:45 +0000
On 20 Mar 2007 17:36:31 -0700, jstevh@xxxxxxxxx wrote:
I had to limit recursion on the self calls as it was getting to be aFor small numbers, less than 1,000,000 say, it can be faster to just
bit much, as I had runs where it factored 50,000+ surrogates as it
recursed calling itself--perfectly--just to factor some dinky number,
which seemed more than necessary.
use trial factoring with a list of primes up to 1,000. If the residue
is less than one million then don't recurse, just convert to an
integer and use trial factoring to finish it off.
rossum
.
- References:
- Surrogate factoring works very well
- From: jstevh
- Re: Surrogate factoring works very well
- From: Mark Murray
- Re: Surrogate factoring works very well
- From: rossum
- Re: Surrogate factoring works very well
- From: Joseph Ashwood
- Re: Surrogate factoring works very well
- From: jstevh
- Surrogate factoring works very well
- Prev by Date: hi...iam a student from nit warangal india plz help me in linux encrypted file system project...
- Next by Date: Re: Surrogate factoring works very well
- Previous by thread: Re: Surrogate factoring works very well
- Next by thread: Re: Surrogate factoring works very well
- Index(es):
Relevant Pages
|