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, Michael Elkin
SIAM Journal on Discrete Mathematics
Alok Aggarwal, Don Coppersmith, et al.
Information Processing Letters
Don Coppersmith, S.E. June Hong, et al.
Data Mining and Knowledge Discovery