of Factorize
Source: Webster's dictionaryAnalogously, prime polynomials (more correctly, irreducible polynomials ) can be defined as non-zero polynomials which cannot be factorized into the product of two non constant polynomials. Source: Internet
For example, these functions can be such that their inverses can be computed only if certain large integers are factorized. Source: Internet
Mersenne numbers are very good test cases for the special number field sieve algorithm, so often the largest number factorized with this algorithm has been a Mersenne number. Source: Internet