in reply to Re^2: Generating powerset with progressive ordering
in thread Generating powerset with progressive ordering

I object to calling the use of divisors a "violation" of the original question. Given the prime factorization, it is a simple matter to multiply out all the possible combinations, giving the list of divisors. Math::Pari's divisor function just saves the work of doing the multiplications and sorting the results.
  • Comment on Re^3: Generating powerset with progressive ordering

Replies are listed 'Best First'.
Re^4: Generating powerset with progressive ordering
by Limbic~Region (Chancellor) on Feb 28, 2005 at 19:55 UTC
    tall_man,
    Given the downvotes - you aren't the only one who feels this way. I still like your solution for brevity, efficiency, and elegance even if it isn't the fastest. I really do need to learn more about Math::Pari.

    Cheers - L~R

[reply]

In Section Seekers of Perl Wisdom