自然数乘法分拆个数及因子个数上界估计

Upper Bound Estimate of the Number of Multiplicative Partions and Divisors

我们证明，若ｎ充分大，则其乘法分拆数小于，这几乎解决了关于自然数乘法分拆数的一个猜测．也得到了自然数因子个数的一个上界估计．

We prove that the number of multiplicative partions of number n is lees than if n is large enough, which almost solve a conjure on the number of multiplicative partions. We also obtain an upper bound cstimate of number of divisors.