arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.1064math.NTmath.CO
收藏

复合数为2的幂的函数的同余性质

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

Giedrius Alkauskas

摘要:

设v(n)表示正整数n的2次幂的合成(有序划分)的个数。看来函数v(n)满足许多模2^N的同余。例如,对于每个整数B,在2-adic拓扑中存在v(2^k+B)的极限(当k趋于无穷大时)。v(n)的奇偶性遵循一个简单的规则。在本文中,我们将这一结果推广到2的更高的权力。特别地,我们证明了对于每个正整数N,存在一个有限表,列出了这个序列模2^N的所有可能的情况。我们的一个主要结果是,v(n)几乎对所有n都能被2 ^N整除,不管N的值有多大。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑