nodef / extra-bigint Goto Github PK

As an improvement please consider prime factors function, described at https://www.geeksforgeeks.org/prime-factors-big-number/. It has significantly smaller complexity than proper divisors implemented currently, and returns basically same information in more convenient format. Actually if this function finds it way to the package, proper divisors could be constructed from it's output with the benefit from its performance.

(it also could be easily improved by stopping the search when n == 1)