Constructive bounds on ordered factorizations

Don Coppersmith, Moshe Lewenstein

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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.

Original languageEnglish
Pages (from-to)301-303
Number of pages3
JournalSIAM Journal on Discrete Mathematics
Issue number2
StatePublished - 2005


  • Factorizations
  • Riemann zeta function


Dive into the research topics of 'Constructive bounds on ordered factorizations'. Together they form a unique fingerprint.

Cite this