A bit more intelligent

AEM_Step2.exs

defmodule AncientEgyptianMultiplication do
  require Integer

  def of(n, _, state) when n <= 1, do: state
  def of(n, closest_number, state) do
    pow_2 = :math.pow(2, closest_number)

    case pow_2 < n do
      true ->
        state = state ++ [pow_2]
        n = n - pow_2
        of(n, closest_number - 1, state)
      false ->
        of(n, closest_number - 1, state)
      end
  end
end