摘要
f(n)表示自然数分拆的个数,本文主要结果是定理2,它给出f(n)的一个上界得到了比Hughes-Shallit猜想1更好的结果。
The f(n) denotes the number of multiplicative partitions of the natural number n.The main result of this paper is theorem 2 which establishes an upper bound for f(n).The result is better than the Hughes-Shallits conjecture l,in additon ,a proof of the conjecture 1 is given as a corollary.
