Banach matchboxes problem and a congruence for primes
  Using an identity arising in the known Banach probability problem on matchboxes, we prove an unexpected congruence for odd prime $p:$ for $1\leq k\leq \frac{p-1}{2},\enskip \sum_{i=1}^{p-2k-1}2^{i-1}\binom{k-1+i}{k}\equiv 0\pmod p.$ 
Vladimir Shevelev
math.HO math.CO