Re^2: Generating powerset with progressive ordering

tall_man,
Regarding using Math::Pari's divisors. This is really cool and I need to learn more about this module. It is however a violation of the original question as stated. Only the prime factorization is to be known initially. I will look at the second part of your response in bit.

Cheers - L~R

Comment on Re^2: Generating powerset with progressive ordering

Replies are listed 'Best First'.
Re^3: Generating powerset with progressive ordering by tall_man (Parson) on Feb 27, 2005 at 22:14 UTC
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.	[reply]
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]