beretboy has asked for the
wisdom of the Perl Monks concerning the following question:
This question is not perl specific, but I would like the help of the monks on it. I am dealing with a variant of a subset-sum problem, in which the set is a list of a number's proper divisors. The goal is to find wether a number is NOT semiperfect (ie. no subset of its divisors sum to it exactly.) Now a normal subset sum problem is O(2^n) complex, in which case I'm screwed because I'm dealing with numbers that have too many factors to complete the calculation in my lifetime (or the universe's for that matter.) I am trying to find (and hoping for) a shortcut based around the fact that all the numbers in the set are able to evenly divide the same number. I'm not saying this is the only shortcut, but its the one that seems likely to me. Any help would be greatly appreciated.
"Sanity is the playground of the unimaginative"