On the Number of Multiplicative Partitions

Abstract

Let $f(n)$ denote the number of essentially different factorizations of $n$. In this paper, we prove that for every odd number $>1$, we have $f(n)\le c\frac{n}{\log n},$ where $c$ is a positive constant.