Is there a standard formula to calculate the number of composite factors using the number of bits of an integer?

  • 1
    $\begingroup$ Clearly, there cannot be any such formula, as the number of divisors is not determined by the bit-size of an integer: for any $n$, there are $n$-bit integers with no composite divisors at all, and there are $n$-bit integers that have as many as $n^{1/\log\log n}$ or so divisors. If, on the other hand, you are only interested in bounds such as I just gave, see en.wikipedia.org/wiki/Divisor_function . $\endgroup$ Aug 19 at 13:54

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.