Some congruences concerning the Bell numbers (Q2365224)

The Bell polynomials are defined recurrently by \(B_{n+1} (x)=x \cdot \sum_{0\leq k\leq n} {n\choose k} B_k(x)\) \((n\geq 0)\), \(B_0(x)=1\). The Bell numbers are \(B_n = B_n(1)\). By defining these polynomials with the application of umbral calculus, the authors obtain new proofs for the most fundamental congruences satisfied by the Bell polynomials and numbers. They prove also the supercongruence \[ B_{np} \equiv B_{n+1} \bmod np \mathbb{Z}_p \] conjectured by M. Zuber. The Bell polynomials and numbers have their importance for applications e.g. in combinatorics and additive number theory.