euler_ex/problems/solutions/21/solution.exs

13 lines
183 B
Elixir

ns = for i <- 1..10_000, into: %{} do
{i, Euler.Algebra.divisors(i) |> Enum.sum()}
end
for {a, b} <- ns,
a != b,
ns[b] == a,
reduce: 0
do
acc -> a + acc
end
|> IO.puts()