Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-24T16:23:00.953Z 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.

Extract

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.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1969

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)Euler, L.Novi Comm. Petrop. III (1750).Google Scholar
(2)Tanturri, A.Atti Accad. Sci. Torino Cl. Sci. Fis. Mat. Natur. 52 (1916), 902908.Google Scholar
(3)Tanturri, A.Atti Accad. Sci. Torino Cl. Sci. Fis. Mat. Natur. 54 (1918), 6982.Google Scholar
(4)Tanturri, A.Atti. Accad. Naz. Lincei Mem. Cl. Sci. Fis. Mat. Natur. Sez I. 27 (1918), 399403.Google Scholar
(5)Mahler, K.J. London Math. Soc. 15 (1940), 115123.CrossRefGoogle Scholar
(6)De Bruijn, N. G.Nederl. Akad. Wetensch. Proc. Ser. A 51 (1948), 659669.Google Scholar
(7)Pennington, W. B.Ann. of Math. 57 (1953), 531546.CrossRefGoogle Scholar
(8)Dickson, L. E.History of the theory of numbers, vol. 2 (1952) (Chelsea Publishing Co., New York, 1952).Google Scholar