Recursive formulae for the multiplicative partition function

Jun Kyo Kim and Sang Guen Hahn

International Journal of Mathematics and Mathematical Sciences, 1999, vol. 22, 1-4

Abstract:

For a positive integer n , let f ( n ) be the number of essentially different ways of writing n as a product of factors greater than 1 , where two factorizations of a positive integer are said to be essentially the same if they differ only in the order of the factors. This paper gives a recursive formula for the multiplicative partition function f ( n ) .

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/22/980892.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/22/980892.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:980892

DOI: 10.1155/S0161171299222132

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().