Having some trouble with this combinatorics problem

  • Thread starter Calabi_Yau
  • Start date
  • #1
35
1
6 friends go to a party, each one carrying a different umbrella. They place the umbrellas outside. When the party is over, they are drunk and each one grabs an umbrella at random.
In how many ways could none of them have taken the right umbrella?

I'm having a bit trouble with this, as I can't seem to solve it without having to do some rough counting some times. Can any of you bother to solve this and explain it to me?
 

Answers and Replies

  • #3
144
0
You are asking about the number of derangments Sn of a set with n elements. If you are looking for an exact answer, you can either use the recurrence relation Sn+1=n(Sn+Sn-1), or compute the alternating sum Ʃ(-1)in!/i! where i goes from 0 to n.
 
  • #4
35
1
Thanks guys.
 

Related Threads on Having some trouble with this combinatorics problem

  • Last Post
Replies
6
Views
2K
Replies
5
Views
2K
Replies
1
Views
538
  • Last Post
Replies
14
Views
4K
  • Last Post
Replies
2
Views
802
  • Last Post
Replies
9
Views
3K
Replies
8
Views
2K
Replies
7
Views
723
  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
9
Views
2K
Top