Congruence properties of binary partition functions

Details Congruence properties of binary partition functions Congruence properties of binary partition functions

2011-02-25

arxiv.org/abs/1102.5355v1

Mathematics

Number Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Congruence properties of binary partition functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Congruence properties of binary partition functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Congruence properties of binary partition functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-301982