1. The problem statement, all variables and given/known data Count all surjections of A to B, (f: A ---> B) where |A| = |B| + 1 2. Relevant equations None? This is just a problem I came across online. 3. The attempt at a solution I'm really not sure. This isn't technically homework, but I'm just looking for a good method. I thought maybe the pigeonhole principle might help?