Re: A factoring algorithm

hart_wb@yahoo.com wrote:
> Hi,
>
> I have a new factoring algorithm which seems to be very fast with
> certain kinds of numbers.
>
> For example it will factor numbers which are the product of two primes
> which are both of the "same kind", and fairly close together (say are
> the same length to within 3 or 4 digits -though that isn't an absolute
> requirement if you do some fiddling and have a little more time), where
> by "same kind" I mean that they are both of the form:
>
> a*b^n+c where a, b and c are "small"

   You mean a, b and c have the same value for p and q (where N=p*q),
and differ only in n? Or a, b, c and n may all have different values for
p and q?

> It's a wierd class of numbers to factor, but the algorithm is not
> contrived.

--Mike Amling
Received on Tue Jan 17 16:48:59 2006