Abstract
We call an integer semismooth with respect to y y and z z if each of its prime factors is ≤ y \le y , and all but one are ≤ z \le z . Such numbers are useful in various factoring algorithms, including the quadratic sieve. Let G ( α , β ) G(\alpha ,\beta ) be the asymptotic probability that a random integer n n is semismooth with respect to n β n^\beta and n α n^\alpha . We present new recurrence relations for G G and related functions. We then give numerical methods for computing G G , tables of G G , and estimates for the error incurred by this asymptotic approximation.

This publication has 14 references indexed in Scilit: