Difference between revisions of "Haskell Quiz/Weird Numbers"

From HaskellWiki
Jump to navigation Jump to search
m (new solution)
 
(2 intermediate revisions by one other user 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]]

Latest revision as of 23:54, 10 August 2008

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.

The problem

Solutions