Perfect numbers: Difference between revisions

Content added Content deleted
m (→‎{{header|Oforth}}: Replace rem by mod)
Line 614:
 
=={{header|Elixir}}==
<lang elixir>defdefmodule is_perfect(x)RC do
def is_perfect(1), do: false
[1 | lc x inlist :lists.seq(2, div(n, 2)), rem(n, x) == 0, do: x] |> :lists.sum() == n▼
def is_perfect(n) when n > 1 do
▲ [1 | lc(for xi inlist<- :lists1..seq(2, div(n, 2)), rem(n, xi) == 0, do: x]i) |> :listsEnum.sum() == n
end
end
 
</lang>▼
IO.inspect (for i <- 1..10000, RC.is_perfect(i), do: i)</lang>
 
{{out}}
<pre>
[6, 28, 496, 8128]
▲</langpre>
 
=={{header|Erlang}}==
Retrieved from "https://rosettacode.org/wiki/Perfect_numbers"