This website requires JavaScript.
Explore
Help
Register
Sign in
aparler
/
RosettaCodeData
Watch
1
Star
0
Fork
You've already forked RosettaCodeData
0
Code
Issues
12
Pull requests
3
Projects
Releases
Packages
Wiki
Activity
Actions
master
RosettaCodeData
/
Task
/
Perfect-numbers
/
Haskell
/
perfect-numbers-1.hs
3 lines
61 B
Haskell
Raw
Permalink
Normal View
History
Unescape
Escape
March 2014 update
2014-04-02 16:56:35 +00:00
perfect
n
=
n
==
sum
[
i
|
i
<-
[
1
..
n
-
1
]
,
n
`
mod
`
i
==
0
]
Reference in a new issue
Copy permalink