Congruence properties of binary partition functions

From MaRDI portal



Abstract: Let A be a finite subset of the natural numbers containing 0, and let f(n) denote the number of ways to write n in the form sumej2j, where ejinA. We show that there exists a computable T = T(A) so that the sequence (f(n) mod 2) is periodic with period T. Variations and generalizations of this problem are also discussed.












This page was built for publication: Congruence properties of binary partition functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950418)