in reply to Re^2: Decomposing sum to unique sets of summands
in thread Decomposing sum to unique sets of summands

Yes, I don't claim it's fast. And I don't think you can do it fast in Perl - you'll have to use some C or other fast language. And even then, you'd still have to convert all the numbers back into Perl numbers to process them.

For the interested, the number of such partitions is A083751 in the OEIS.

  • Comment on Re^3: Decomposing sum to unique sets of summands