<p>Given an integer n, is there an efficient algorithm to find the number of factors of n?</p>

CC BY-SA 3.0
2015-07-30T12:15:42.303Z
http://mathoverflow.net/questions/3820/how-hard-is-it-to-compute-the-number-of-prime-factors-of-a-given-integer
Tyson Williams
CC BY-SA 3.0
2015-07-30T15:19:15.857Z
Thank you. So I shouldn't expect there would be such an algorithm.
Solveit
<factoring>
Efficient algorithm to find number of factors
Solveit
# Efficient algorithm to find number of factors

(Asked by: username_0 on 2015-07-30)

Given an integer n, is there an efficient algorithm to find the number of factors of n?

**Tags:** factoring

> **Comments:**
> **username_1**: http://mathoverflow.net/questions/3820/how-hard-is-it-to-compute-the-number-of-prime-factors-of-a-given-integer  
> **username_0**: Thank you. So I shouldn't expect there would be such an algorithm.  

---

## 0 answers

