Ein Problem bei dyadischer Zahlendarstellung (Q2649219)

Let \(1, 10, 11, \ldots\) be the set \(S\) of positive integers \(< 2^p\), written in the binary system, and \((k, h)_p\) be the number of times, that a number of \(S\) with \(k\) digits one precedes a number with \(h\) ones. It is proved, that for \(0 < h < k\) and a prime \(p\) holds \((k, h)_p \equiv 0\pmod p\), if \(h + k < p\) and \((k, h)_p \equiv (-1)^k\pmod p\), if \(h + k = p\). The proof which is elementary, is based on \[ (k,1)_p=\binom{p}{k+1},\quad (k, h)_p =\sum_{n=k}^{p-1}\left(\binom nk\binom{n}{h-1}+(k-1,h-1)_n\right). \] With the help of these relations some numerical examples are added.