Recursive formulae for the multiplicative partition function
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1999-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171299222132 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832549038867611648 |
|---|---|
| author | Jun Kyo Kim Sang Guen Hahn |
| author_facet | Jun Kyo Kim Sang Guen Hahn |
| author_sort | Jun Kyo Kim |
| collection | DOAJ |
| description | 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). |
| format | Article |
| id | doaj-art-74bc85b16f644e1e808f57fd08ee3be5 |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1999-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-74bc85b16f644e1e808f57fd08ee3be52025-02-03T06:12:20ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251999-01-0122121321610.1155/S0161171299222132Recursive formulae for the multiplicative partition functionJun Kyo Kim0Sang Guen Hahn1Korea Advanced Institute of Science and Technology 373-1, Kusong Don, Yusung Gu, Taejon 305-701, KoreaKorea Advanced Institute of Science and Technology 373-1, Kusong Don, Yusung Gu, Taejon 305-701, KoreaFor 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).http://dx.doi.org/10.1155/S0161171299222132Partitionsmultiplicative partitions. |
| spellingShingle | Jun Kyo Kim Sang Guen Hahn Recursive formulae for the multiplicative partition function International Journal of Mathematics and Mathematical Sciences Partitions multiplicative partitions. |
| title | Recursive formulae for the multiplicative partition function |
| title_full | Recursive formulae for the multiplicative partition function |
| title_fullStr | Recursive formulae for the multiplicative partition function |
| title_full_unstemmed | Recursive formulae for the multiplicative partition function |
| title_short | Recursive formulae for the multiplicative partition function |
| title_sort | recursive formulae for the multiplicative partition function |
| topic | Partitions multiplicative partitions. |
| url | http://dx.doi.org/10.1155/S0161171299222132 |
| work_keys_str_mv | AT junkyokim recursiveformulaeforthemultiplicativepartitionfunction AT sangguenhahn recursiveformulaeforthemultiplicativepartitionfunction |