Some Elementary Congruences for the Number of Weighted Integer Compositions (1504.00389v1)

Abstract: An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted integer compositions (also called $f$-colored integer compositions in the literature), in which each part size $s$ may occur in $f(s)$ different colors, is given by the extended binomial coefficient $\binom{k}{n}{f}$. We derive several congruence properties for $\binom{k}{n}{f}$, most of which are analogous to those for ordinary binomial coefficients. Among them is the parity of $\binom{k}{n}{f}$, Babbage's congruence, Lucas' theorem, etc. We also give congruences for $c{f}(n)$, the number of $f$-weighted integer compositions with arbitrarily many parts, and for extended binomial coefficient sums. We close with an application of our results to prime criteria for weighted integer compositions.