Estimating the number of multiplicative partitions
type: Item
instance of: scholarly article
title: Estimating the number of multiplicative partitions
zbMATH Open document ID: 0643.10009
DOI: 10.1216/RMJ-1987-17-4-797
author: F. W. Dodd
author: L. E. Mattics
published in: Rocky Mountain Journal of Mathematics
publication date: 1987-01-01T00:00:00Z
review text: Let f(n) be the number of essentially different factorisations of n: for example \(f(12)=4\) since \(12=1.12=2.6=3.4=2.2.3.\) It is proved that \((i)\quad f(n)\leq n(\log n)^{-\alpha}\) for each \(\alpha >0\) and all \(n>n(\alpha)\); \((ii)\quad f(n)\leq (\log n)^{-1}\) for all \(n>1\), \(n\neq 144\). These improve the result f(n)\(\leq n\) already obtained by the authors, in response to a conjecture of \textit{J. F. Hughes} and \textit{J. O. Shallit} [Am. Math. Mon. 90, 468-471 (1983; Zbl 0523.10007)]. An independent asymptotic result of \textit{E. R. Canfield}, \textit{P. Erdős} and \textit{C. Pomerance} [J. Number Theory 17, 1-28 (1983; Zbl 0513.10043)] is stronger than (i) but does not imply (ii).
Mathematics Subject Classification ID: 11P81
Mathematics Subject Classification ID: 11A25
Mathematics Subject Classification ID: 11A05
zbMATH DE Number: 4047799
zbMATH Keywords: factorizations
zbMATH Keywords: multiplicative partitions
zbMATH Keywords: multiplicative function
zbMATH Keywords: Hughes-Shallit conjecture
MaRDI profile type: Publication
Recommended article: An estimate of the enumeration function of multiplicative partitions
Recommended article: On the Number of Multiplicative Partitions
Recommended article: Q3762395
Recommended article: Q3480159
Recommended article: Q4271716
Recommended article: Estimate of the number of restricted integer-partitions
Recommended article: Q4855955
Recommended article: Q4232837
Recommended article: A Bound for the Number of Multiplicative Partitions
Recommended article: On the number of multiplicative partitions of a multi-partite number
description: scientific article; zbMATH DE number 4047799