integer factorization algorithm

noun
UK /ˈɪn.tɪ.dʒər ˌfæk.tər.aɪˈzeɪ.ʃən ˈæl.ɡə.rɪ.ðəm/
US /ˈɪn.t̬ə.dʒɚ ˌfæk.tɚ.əˈzeɪ.ʃən ˈæl.ɡə.rɪ.ðəm/

A set of steps a computer follows to break a whole number into smaller numbers that multiply together to make it.

The integer factorization algorithm found that 91 equals 7 times 13.


OTHER MEANINGS

2. A procedure used in computer security to test how hard a number is to break apart.

Researchers compared each integer factorization algorithm to see which one cracked large numbers fastest.

3. A mathematical recipe for finding all the prime factors of a given integer.

Her homework asked her to apply an integer factorization algorithm to 360.

4. A computational tool studied in number theory for splitting composite numbers into primes.

The integer factorization algorithm is a key topic in number theory classes.