- #1
Ciaran
- 72
- 0
Hello,
I wonder if anyone could settle a disagreement I'm having with one of my peers. The question is 'How many surjective functions are there from a set of size n+3 to a set of size n?'. Now, I've already proven that there are (n+1 choose 2)n! surjective functions from a set of size n+1 to a set of size n. I've also proven that there are (n+2 choose 3)n!+ (n+2 choose n-2,2,2)n! surjective functions from a set of size n+2 to a set of size n.
Now, for the question in hand, I got that there would be n(2^(n+3)) + (n+3). 2^n such functions. Am I right? He doesn't believe me because I proved it in a different way to the other ones. This time, my proof did not involve any x choose y statements; I derived a kind of formula because I found the potential choices too complicated. Also, would anyone be able to construct such a proof? This is solely for my peace of mind- I'd like my three proofs to be of a similar looking nature!
Thanks!
I wonder if anyone could settle a disagreement I'm having with one of my peers. The question is 'How many surjective functions are there from a set of size n+3 to a set of size n?'. Now, I've already proven that there are (n+1 choose 2)n! surjective functions from a set of size n+1 to a set of size n. I've also proven that there are (n+2 choose 3)n!+ (n+2 choose n-2,2,2)n! surjective functions from a set of size n+2 to a set of size n.
Now, for the question in hand, I got that there would be n(2^(n+3)) + (n+3). 2^n such functions. Am I right? He doesn't believe me because I proved it in a different way to the other ones. This time, my proof did not involve any x choose y statements; I derived a kind of formula because I found the potential choices too complicated. Also, would anyone be able to construct such a proof? This is solely for my peace of mind- I'd like my three proofs to be of a similar looking nature!
Thanks!