 In fact, if is a divisor of such that , then is a divisor of such that .If one tests the values of in increasing order, the first divisor that is found is necessarily a prime number, and the "cofactor" cannot have any divisor smaller than .For getting the complete factorization, it suffices thus to continue the algorithm by searching a divisor of that is not smaller than and not greater than .