more useful options | |
PerlMonks |
Re^3: Generating powerset with progressive orderingby tall_man (Parson) |
on Feb 27, 2005 at 22:14 UTC ( [id://434940]=note: print w/replies, xml ) | Need Help?? |
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.
In Section
Seekers of Perl Wisdom
|
|