11. The fundamental theorem of arithmetic says that every positive integer has a single unique prime factorization . 12. The integer factorization problem is the computational problem of determining the prime factorization of a given integer. 13. The number of factors of " b n " is given using its prime factorization . 14. As noted prime factorization are also inefficient; many modern cryptography systems even rely on that inefficiency. 15. This contradiction shows that " s " does not actually have two different prime factorizations . 16. This characterization makes it possible to determine whether a number is practical by examining its prime factorization . 17. A "'septimal comma "'is a small seven in its prime factorization . 18. The asymptotically best efficiency is obtained by computing " n " ! from its prime factorization . 19. In order to find the greatest common divisor, the Euclidean algorithm or prime factorization may be used. 20. The prime factorization of twenty is 2 2 ?5, so it is not a perfect power.
