Elixir Count Div
defmodule CountDiv do
def count_div(a, b, k) do
first_div = if rem(a, k) == 0, do: a, else: a + (k - rem(a, k))
last_div = b - rem(b, k)
div(last_div - first_div, k) + 1
end
end
This counts how many numbers in a range are divisible by K without looping through every value.