Hostname: page-component-7b7567c8c-p67k6 Total loading time: 0 Render date: 2026-11-19T20:17:59.068Z Has data issue: false hasContentIssue false

Congruence properties of the binary partition function

Published online by Cambridge University Press:  24 October 2008

M. D. Hirschhorn
Affiliation:
School of Mathematics, University of New South Wales, Kensington, N. S. W., Australia
J. H. Loxton
Affiliation:
School of Mathematics, University of New South Wales, Kensington, N. S. W., Australia
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.

We denote by b(n) the number of binary partitions of n, that is the number of partitions of n as the sum of powers of 2. As usual, two partitions are not considered to be distinct if they differ only in the order of their summands. It is convenient to define b(0) = 1.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1975