So i have a certain problem:
There are n students at an acquaintance party, that haven't known each other before that night. How many ways are there to befriend, if every student get's at least one friend.
SO i'm thinking of using inclusion-exclusion principle. But am not sure how to calculate it. Any help would be appreciated.