RosettaCodeData/Task/Perfect-numbers/OCaml/perfect-numbers-1.ml
2024-10-16 18:07:41 -07:00

7 lines
131 B
OCaml

let perf n =
let sum = ref 0 in
for i = 1 to n-1 do
if n mod i = 0 then
sum := !sum + i
done;
!sum = n