What is the primary step in computing the prime factors of an integer n?
1
Divide n by the smallest possible integer until it cannot be divided further
2
Add n to the list of prime numbers
3
Multiply n by its smallest divisor
4
Subtract 1 from n repeatedly