Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-07T04:45:02.128Z Has data issue: false hasContentIssue false
  • English
  • Français

On the mean value of the enumeration function for multiplicative partitions

Published online by Cambridge University Press:  17 April 2009

Cao Hui-Zong  and
Ku Tung-Hsin
Cao Hui-Zong
Affiliation:
Department of Mathematics, Shandong University, Jinan Shandong, China
Ku Tung-Hsin
Affiliation:
The Hefei Branch of Combinatorial Maths, Academia Sinica, Hefei Anhui, China
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let g(n) denote the number of multiplicative partitions of the natural number n. We prove that

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 41 , Issue 3 , June 1990 , pp. 407 - 410
Copyright
Copyright © Australian Mathematical Society 1990

References

[1]de Bruijn, N.G., ‘On the number of positive integers ≤ x and free of prime factors > y’, Indag. Math. 13 (1951), 50–60.CrossRefGoogle Scholar
[2]Xiao-Xia, Chen, ‘On multiplicative partitions of natural number’, Acta Math. Sinica 30 (1987), 268–271.Google Scholar
[3]Hughes, John F. and Shallit, J.O., ‘On the number of multiplicative partitions’, Amer. Math. Monthly 90 (1983), 468–471.Google Scholar
[4]Titchmarsh, E.C., The theory of the Riemann Zeta–Function (OUP, 1951).Google Scholar