  A celebrated analogy between prime factorizations of integers and cycle
decompositions of permutations is explored here. Asymptotic formulas
characterizing semismooth numbers (possessing at most several large factors)
carry over to random permutations. We offer a survey of practical methods for
computing relevant probabilities of a bivariate or trivariate flavor.
