This technical report was originally a note dated 1 May 1998, not
intended for publication. This version is identical to the original,
though we've taken the opportunity to update references and correct
a minor typo. The note details how the performance of the Pollard rho
algorithm might be expected to change as the number of partitions used
by the next-state function varies.