Skip to main content
Article thumbnail
Location of Repository

Congruence properties of binary partition functions

By Katherine Anders, Melissa Dennison, Bruce Reznick and Jennifer Weber

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 $\sum e_j2^j$, where $\e_j \in A$. 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

Topics: Mathematics - Number Theory, Mathematics - Combinatorics, Primary:11A63, 11B50, 11P81
Year: 2011
OAI identifier: oai:arXiv.org:1102.5355
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1102.5355 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.