defmodule Findthedivisors do

  def divisors(integer) do
    integer
    |> check_divisor(integer - 1)
  end

  def check_divisor(integer, n, result \\ [])

  def check_divisor(integer, n, result) when n <= 1 do
    case Enum.empty?(result) do
      true -> "#{integer} is prime"
      false -> Enum.sort(result)
    end
  end

  def check_divisor(integer, n, result) do
    case Integer.mod(integer, n) do
      0 -> check_divisor(integer, n - 1, result ++ [n])
      _ -> check_divisor(integer, n - 1, result)
    end
  end
end