- #1
- 143
- 0
Given a number n, what would be the computationally most efficient procedure to find the number of unique factorizations.
e.g. 24 has 4 factorizations
24 = 1 * 24
= 2 * 12
= 3 * 8
= 4 * 6
e.g. 24 has 4 factorizations
24 = 1 * 24
= 2 * 12
= 3 * 8
= 4 * 6