2 lfactor - smallest prime factor in first specified number of primes
9 m nonnegative integer <= 203280221 (= number of primes < 2^32)
11 return positive integer
14 If n >= 0 and n has a prime factor in the first m primes,
15 lfactor(n, m) returns the smallest such factor.
17 If n < 0, -1 is returned.
20 > print lfactor(35,2), lfactor(35,3), lfactor(-35, 3)
23 > print lfactor(2^32+1,115), lfactor(2^32+1,116), lfactor(2^59-1,1e5)
30 NUMBER *qlowfactor(NUMBER *n, NUMBER *count)
31 FULL zlowfactor(ZVALUE z, long count)