Talk:Weird numbers: Difference between revisions
m
→A faster and less ambitious algorithm ?
Line 11:
# Use a recursive '''hasSum'''(''target'', ''divisorList'') predicate which fails early.
# Generate the properDivisors in '''descending''' order of magnitude.
A smaller target should, I think, involve a smaller number of possible sums. The obvious candidate in an abundant number is the '''difference''' between the sum of the proper divisors and the number considered. If a sum to that difference exists, then removing the participants in the smaller sum will leave a set which sums to the abundant number itself.
| |||