Special factorization method sought

From: Risto Lankinen (rlankine_at_hotmail.com)
Date: 06/29/05

  • Next message: Andrew Swallow: "Re: OT: purely political, but of some analytic interest was Re: Legality of bugging mosques" 
    Date: Wed, 29 Jun 2005 09:50:29 GMT

    Hi!

    A handful of specialized factorization algorithms exist for
    integers having a special structure (for instance, Mersenne
    numbers). Are there any special algorithms for factorizing
    integers that are known to have factors of "nearly the same
    size". Here's an attempt to define "nearly the same size":

    If in (n = xy) it is true that (x > y > x/2), then factors x and y
    are "nearly the same size".

    Note that x and y don't need to be primes themselves, e.g.
    7*71*701*7001=2439127397 has got "nearly same size"
    factors, namely 7*7001=49007 and 71*701=49771 .

    I'll appreciate all replies.

    Cheers!

     - Risto -

  • Next message: Andrew Swallow: "Re: OT: purely political, but of some analytic interest was Re: Legality of bugging mosques"