 For computing the factorization of an integer , one needs an algorithm for finding a divisor of or deciding that is prime.When such a divisor is found, the repeated application of this algorithm to the factors and gives eventually the complete factorization of .For finding a divisor of , if any, it suffices to test all values of such that and .