Hostname: page-component-7479d7b7d-m9pkr Total loading time: 0 Render date: 2024-07-13T19:01:38.682Z Has data issue: false hasContentIssue false
  • English
  • Français

The Theory of Compositions (I): the Ordered Factorizations of n and a Conjecture of C. Long

Published online by Cambridge University Press:  20 November 2018

George E. Andrews
George E. Andrews*
Affiliation:
The Pennsylvania State UniversityUniversity Park, Pennsylvania16802
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.

Several years ago, C. Long wrote two papers ([3], [4]) that related to F(n) the number of ordered factorizations of n. The second of these papers [4] was devoted entirely to a discussion of conjectured formula for F(n).

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 18 , Issue 4 , October 1975 , pp. 479 - 484
Copyright
Copyright © Canadian Mathematical Society 1975

References

1. Goldman, J. and Rota, G. C., The number of subspaces of a vector space, in Recent Progress in Combinatories edited by W. Tutte, Academic Press, New York, 1969, pp. 75–83.Google Scholar
2. Landau, E., Elementary Number Theory, Chelsea, New York, 1958.Google Scholar
3. Long, C., Addition Theorems for sets of integers, Pacific J. Math., 23 (1967), 107–112.Google Scholar
4. Long, C., On a problem in partial difference equations, Can. Math. Bull., 13 (1970), 333–335.Google Scholar
5. MacMahon, P. A., Combinatory Analysis, Vol. 1, Cambridge University Press, Cambridge 1915 (Reprinted: Chelsea, New York, 1960).Google Scholar
6. Riordan, J., An Introduction to Combinatorial Analysis, John Wiley and Sons, New York, 1958.Google Scholar
7. Rota, G. C., The number of partitions of a set, Amer. Math. Monthly, 71 (1964), 498–504.Google Scholar