Find the list of prime numbers upto n

prime.ex

defmodule Prime do
  def run(number) do
    max = :math.sqrt(number) |> round
    result = Enum.to_list(2..number)
    run(max, result, {result, []})
  end
  def run(0, _, {res, sieve}) do
    Enum.reverse(sieve) ++ res
  end
  def run(max, [ head | _ ], {result, sieve}) do
    res = Enum.filter(result, fn(x) ->
      rem(x, head) > 0
    end)
    run(max - 1, res,  {res, [ head | sieve ] } )
  end
end

prime_test.exs

defmodule PrimeTest do
  use ExUnit.Case
  test "prime number" do
    assert Prime.run(59) === [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]
  end
end