➗Divisors of n

1. Automate Community
2. Tutorials & Examples

Efficiently finds and returns an array of divisors of n (except 1 and n, because those are trivial)

⚠️ warning: Don't pass big numbers, as those will generate an extremely long list. If you have a flow that needs to iterate over divisors, do it on the fly (like a generator/coroutine), don't push to an array.

Tags: math arithmetic primes square root sqrt algorithm

LICENSE: https://unlicense.org