Perfect numbers: Difference between revisions
Content added Content deleted
Line 551: | Line 551: | ||
return sum <=> x |
return sum <=> x |
||
}</lang> |
}</lang> |
||
=={{header|Elixir}}== |
|||
<lang elixir>def is_perfect(x) do |
|||
[1 | lc x inlist :lists.seq(2, div(n, 2)), rem(n, x) == 0, do: x] |> :lists.sum() == n |
|||
end |
|||
</lang> |
|||
=={{header|Erlang}}== |
=={{header|Erlang}}== |
||
<lang erlang>is_perfect(X) -> |
<lang erlang>is_perfect(X) -> |
||
X == lists:sum([N || N <- lists:seq(1,X-1), X rem N == 0]).</lang> |
X == lists:sum([N || N <- lists:seq(1,X-1), X rem N == 0]).</lang> |
||
=={{header|F_Sharp|F#}}== |
=={{header|F_Sharp|F#}}== |