Count the divisible numbers

[shorodilov]

Gather 3 numbers: x, y and k.
Count numbers within range [x..y] (both ends are included) that are divisible by k.
Also create a function to return these numbers.

More scientifically: { i : x ≤ i ≤ y, i mod k = 0 }

Tasks:

• write a function to return the number of divisible items
• write a function to return a list of divisible items

[shorodilov]

Constant time is possible (O(1)) - benchmark test required.

[Rishitha-VasiReddy]

Hi @shorodilov, I would like to work on this issue. Could you please assign this to me.

[shorodilov]

Hi @shorodilov, I would like to work on this issue. Could you please assign this to me.

done

[shorodilov]

I believe calc package is a good place to implement this functions.

Naming propose:
get_divisible_by and get_divisible_by_count.