scientific article; zbMATH DE number 13039

From MaRDI portal
Publication:3977646





For positive integers \(m\) and \(n\), define \(f_ 2(m,n)\) to be the number of different ways to write \((m,n)\) as a product \((a_ 1,b_ 1)(a_ 2,b_ 2)\dots(a_ k,b_ k)\), where the multiplication is done coordinate-wise, all \(a_ i\) and \(b_ i\) are positive integers, (1,1) is not used as a factor of \((m,n)\neq(1,1),\) and two such factorizations are considered the same if they differ only in the order of the factors. In particular, \(f(m)=f_ 2(m,1)\) is the number of multiplicative partitions of \(m\). \(f(m)\) has been investigated by several authors. \textit{F. W. Dodd} and \textit{L. E. Mattics} [Rocky Mt. J. Math. 17, 797-813 (1987; Zbl 0643.10009){]} showed that \(f(m)\leq m/\log m\) for \(m\neq1,144\). In the paper under review the authors prove that \(f_ 2(m,n)<(mn)^{1.516}/\log(mn)\) for \((m,n)\neq(1,1)\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977646)