ON A CONJECTURE FOR THE NUMBER OF MULTIPLICATIVE PARTITIONS OF A NATURAL NUMBER

被引：0
|
作者：
陈小夏
机构：
[1] PRC
[2] Hangzhou Normal College
[3] Hangzhou 310012
[4] Department of Mathematics
来源：
Science Bulletin | 1991年 / 06期
关键词：
In; ON A CONJECTURE FOR THE NUMBER OF MULTIPLICATIVE PARTITIONS OF A NATURAL NUMBER;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let f(n)denote the number of factorizations of the natural number n into factors larger than 1, not considering the order of the factors. We call each of these factorizations a multiplicative partition of n, or simply, partition. Also let f(1)=1. On the upper bound of f(n), J. F. Hughes and J. O. Shallit proved that f(n)≤2n~(2) and mentioned two conjectures:
引用
收藏
页码：517 / 518
页数：2
相关论文
共 50 条
12345