We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 51974c1 commit 8d2d9c5Copy full SHA for 8d2d9c5
1 file changed
Math.ark
@@ -255,7 +255,7 @@
255
(let prime? (fun (n)
256
(if (= 2 n)
257
true
258
- (if (or (= 0 (mod n 2)) (= 1 n))
+ (if (or (= 0 (mod n 2)) (= 1 n) (!= 0 (mod n 1)))
259
false
260
{
261
(let k (ceil (+ 1 (sqrt n))))
@@ -276,6 +276,7 @@
276
# @author https://github.com/Wafelack
277
(let divs (fun (n) {
278
(assert (>= n 1) "divs: n must be greater or equal to 1")
279
+ (assert (= 0 (mod n 1)) "divs: n must be an integer")
280
(mut i 1)
281
(mut divisors [])
282
(let top (ceil (/ n 2)))
0 commit comments