Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T10:04:56.790Z Has data issue: false hasContentIssue false

Congruence properties of the binary partition function

Published online by Cambridge University Press:  24 October 2008

R. F. Churchhouse
Affiliation:
Atlas Computer Laboratory, Chilton, Didcot, Berks.
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 ways of expressing the positive integer n as the sum of powers of 2 and we call b(n) ‘the binary partition function’. This function has been studied by Euler (1), Tanturri (2–4), Mahler (5), de Bruijn(6) and Pennington (7). Euler and Tanturri were primarily concerned with deriving formulae for the precise calculation of b(n), whereas Mahler deduced an asymptotic formula for log b(n) from his analysis of the functions satisfying a certain class of functional equations. De Bruijn and Pennington extended Mahler's work and obtained more precise results.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1969