# Haskell Quiz/Weird Numbers

### From HaskellWiki

< Haskell Quiz(Difference between revisions)

m (new solution) |
(+cat) |
||

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]] |
||

+ | |||

+ | [[Category:Haskell Quiz]] |

## Revision as of 10:28, 13 January 2007

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.