Another update from ingydotnet^djgoku

Task/Perfect-numbers/Elixir/perfect-numbers.elixir

@@ -1,3 +1,8 @@
-def is_perfect(x) do
-  [1 | lc x inlist :lists.seq(2, div(n, 2)), rem(n, x) == 0, do: x] |> :lists.sum() == n
+defmodule RC do
+  def is_perfect(1), do: false
+  def is_perfect(n) when n > 1 do
+    (for i <- 1..div(n,2), rem(n,i)==0, do: i) |> Enum.sum == n
+  end
 end
+
+IO.inspect (for i <- 1..10000, RC.is_perfect(i), do: i)