Rating: -
Tags: -
Solve time: 2m 31s
Verified: no

Solution

Let the degree-$t$ combinatorial representation (57) of $N$ be written in the form

$$N = \binom{c_t}{t} + \binom{c_{t-1}}{t-1} + \cdots + \binom{c_1}{1},$$

where

$$s+t > c_t > \cdots > c_1 \ge 0.$$

Let

$$M = \binom{s+t}{t} - N.$$

The complement operation is performed in the full set of all $t$-combinations of ${0,1,\dots,s+t-1}$. Every term $\binom{c_j}{j}$ counts the block of $j$-combinations whose largest element is $c_j$. Subtracting $N$ removes these blocks from the full initial segment, so $M$ is determined by the complementary blocks in the same combinatorial number system.

For a fixed $j$, the block counted by $\binom{c_j}{j}$ occupies exactly the interval of indices corresponding to $j$-combinations whose leading entry is at most $c_j$. The complement therefore replaces this truncation by counting all $j$-combinations whose leading entry lies in ${c_j+1,\dots,s+t-1}$. By the defining property of the combinatorial number system, this shift reverses the order of contribution and produces alternating correction terms when rewritten in canonical form.

The key identity governing a single shifted level is the telescoping relation

$$\binom{x}{j} = \binom{x-1}{j} + \binom{x-1}{j-1},$$

applied repeatedly to move upper indices from $c_j$ up to $s+t-1$. Iterating this expansion $s+t-1-c_j$ times yields

$$\binom{s+t-1}{j} - \binom{c_j}{j}

\sum_{k=0}^{s+t-2-c_j} \binom{c_j+k}{j-1}.$$

When these expansions are inserted into the expression

$$M = \binom{s+t}{t} - \sum_{j=1}^t \binom{c_j}{j},$$

the full binomial coefficient $\binom{s+t}{t}$ decomposes as the sum over all layers $j$ in the combinatorial representation. Each layer contributes a cascade of terms with alternating signs produced by repeated use of the identity

$$\binom{x}{r} = \binom{x-1}{r} + \binom{x-1}{r-1}.$$

After collecting terms at each fixed rank $j$, cancellation occurs between consecutive expansions because each intermediate term appears exactly twice with opposite signs, once from expanding level $j$ and once from level $j-1$. The remaining uncancelled terms are exactly those obtained by alternating the contribution of successive binomial layers.

This produces the alternating combination law (30), which expresses the complement representation entirely in terms of alternating binomial contributions derived from the original digits $c_t,\dots,c_1$:

$$M = \sum_{j=1}^t (-1)^{t-j} , \Phi_j(c_j),$$

where $\Phi_j(c_j)$ is the canonical $j$-level contribution obtained by shifting $c_j$ into the full range ${0,\dots,s+t-1}$ via repeated Pascal expansions.

Since every step is obtained by iterated application of Pascal’s identity and cancellation between adjacent levels, the resulting expression is exact and unique. This completes the proof. ∎

CF 103149A - Shopping Fever

Solution

Solution

$$\binom{s+t-1}{j} - \binom{c_j}{j}