# Haskell Quiz/Weird Numbers

### From HaskellWiki

< Haskell Quiz(Difference between revisions)

m (new solution) |
|||

Line 8: | Line 8: | ||

* [[Haskell Quiz/Weird Numbers/Solution Bailey|Justin Bailey]] |
* [[Haskell Quiz/Weird Numbers/Solution Bailey|Justin Bailey]] |
||

+ | * [[Haskell Quiz/Weird Numbers/Solution Dolio|Dan Doel]] |

## Revision as of 01:51, 27 October 2006

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.