Inder S. Gopal, Don Coppersmith, et al.
IEEE TC
Paper
Constructive bounds on ordered factorizations
Abstract
The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions. © 2005 Society for Industrial and Applied Mathematics.
Related
Don Coppersmith, David Gamarnik, et al.
Random Structures and Algorithms
Don Coppersmith, Andrew M. Odlzyko, et al.
Algorithmica
Don Coppersmith, Nick Howgrave-Graham, et al.
Journal of Discrete Algorithms