Congruence properties of the function which counts compositions into powers of 2

Details Congruence properties of the function which counts compositions into powers of 2 Congruence properties of the function which counts compositions into powers of 2

2010-03-04

arxiv.org/abs/1003.1064v2

Journal of Integer Sequences 13 (2010), Article: 10.5.3, 9 p.

Mathematics

Number Theory

8 pages

Scientific paper

Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to infinity) the limit of v(2^k+B) in the 2-adic topology. The parity of v(n) obeys a simple rule. In this paper we extend this result to higher powers of 2. In particular, we prove that for each positive integer N there exists a finite table which lists all the possible cases of this sequence modulo 2^N. One of our main results claims that v(n) is divisible by 2^N for almost all n, however large the value of N is.

Affiliated with

Also associated with

No associations

Rating

Congruence properties of the function which counts compositions into powers of 2 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 the function which counts compositions into powers of 2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Congruence properties of the function which counts compositions into powers of 2 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560281