This website works better with JavaScript
Home
Explore
Help
Sign In
CNI
/
HaskellCourse
Watch
3
Star
0
Fork
0
Files
Issues
0
Pull Requests
0
Wiki
Browse Source
Create a function to list the dividers of a number
DricomDragon
5 years ago
parent
2653b1013f
commit
2c73d8afb1
1 changed files
with
4 additions
and
0 deletions
Split View
Show Diff Stats
4
0
prime.hs
+ 4
- 0
prime.hs
View File
@@
-0
,
0
+
1
,
4
@@
+
-- Exercice from slide 42/82
+
+dividers n = [k | k <- [
2.
.(n
-1
)], rem n k ==
0
]
+