Haskell Quiz/Weird Numbers
From HaskellWiki
< Haskell Quiz(Difference between revisions)
m (new solution) |
|||
| (2 intermediate revisions not shown.) | |||
| Line 9: | Line 9: | ||
* [[Haskell Quiz/Weird Numbers/Solution Bailey|Justin Bailey]] | * [[Haskell Quiz/Weird Numbers/Solution Bailey|Justin Bailey]] | ||
* [[Haskell Quiz/Weird Numbers/Solution Dolio|Dan Doel]] | * [[Haskell Quiz/Weird Numbers/Solution Dolio|Dan Doel]] | ||
| + | * [[Haskell Quiz/Weird Numbers/Solution Ninju|Alex Watt]] | ||
| + | |||
| + | [[Category:Haskell Quiz|Weird Numbers]] | ||
Current revision
RubyQuiz #57: A weird number is defined as a number, n, such that the sum of all its divisors (excluding n itself) is greater than n, but no subset of its divisors sums up to exactly n.
