Hostname: page-component-77c89778f8-m42fx Total loading time: 0 Render date: 2024-07-16T21:12:32.949Z Has data issue: false hasContentIssue false

On m-ary partitions

Published online by Cambridge University Press:  24 October 2008

Hansraj Gupta
Affiliation:
Allahabad University, Allahabad, India

Extract

1. Let g(n) = g(n; m) denote the number of partitions of a natural number n into powers of a given natural number m (> 2). Then the generating function of g(n) is

(1) where we take g(0) = 1.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1972

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Churchhouse, R. F.Congruence properties of the binary partition function. Proc. Cambridge Philos. Soc. 66 (1969), 371376.CrossRefGoogle Scholar
(2)Andrews, G. E.Congruence properties of the m-ary partition function. J. Number Theory 3 (1971), 104110.CrossRefGoogle Scholar