An elementary (number theory) proof of Touchard's congruence
Abstract
Let Bn denote the nth Bell number. We use well-known recursive expressions for Bn to give a generalizing recursion that can be used to prove Touchard's congruence.
0
Let Bn denote the nth Bell number. We use well-known recursive expressions for Bn to give a generalizing recursion that can be used to prove Touchard's congruence.