An elementary (number theory) proof of Touchard's congruence
Combinatorics
2009-06-08 v2
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.
Cite
@article{arxiv.0906.0696,
title = {An elementary (number theory) proof of Touchard's congruence},
author = {Greg Hurst and Andrew Schultz},
journal= {arXiv preprint arXiv:0906.0696},
year = {2009}
}
Comments
5 pages Update: Typo in email address for first author corrected