An elementary (number theory) proof of Touchard's congruence
classification
🧮 math.CO
keywords
congruencenumbertouchardbelldenoteelementaryexpressionsgeneralizing
read the original abstract
Let B_n denote the nth Bell number. We use well-known recursive expressions for B_n to give a generalizing recursion that can be used to prove Touchard's congruence.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.