Anonymous user
Zumkeller numbers: Difference between revisions
m
added a category.
(→{{header|Pascal}}: new recursive search: only 853112 recursions for n = 10884600 with count of divisors 72 . 205283 odd abundant numbers less than 10^8 takes now 65 s) |
m (added a category.) |
||
Line 1:
{{task|Prime Numbers}}
Zumkeller numbers are the set of numbers whose divisors can be partitioned into two disjoint sets that sum to the same value. Each sum must contain divisor values that are not in the other sum, and all of the divisors must be in one or the other. There are no restrictions on ''how'' the divisors are partitioned, only that the two partition sums are equal.
Line 5,278:
1145529 1162161 1198197 1224531 1270269 1307691 1324323 1378377
</pre>
[[Link title]]
| |||