A magician takes a deck of 5 2 playing cards and records their position, labelled i for a card C (i.e. the Queen of Spades is on top ( C 1 ), the 5 of Diamonds is beneath ( C 2 )... the 1 0 of Spades is on the bottom ( C 5 2 )). Then, he gives the cards to his assistant, who shuffles them in a completely random manner. The magician then records the cards' resulting positions, C i ′ .
What is the probability that no cards are in their starting position? In other terms, what is the probability that for any card C i , C i = C i ′ ? Write your answer as a percentage.
Note: The assistant doing nothing is one possible configuration: in other terms, C i = C i ′
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
It is worth noting that another way of writing the number for your solution is n ! ! n = n ! ⌊ e n ! + 2 1 ⌋ and since n ! is very large this answer is very close to e 1 . In fact as decimals they differ only in the 1 0 t h decimal place.
Log in to reply
Thank you! As a matter of fact, lim n → ∞ n ! ! n = e 1 . As a matter of fact, I am curious about from where e comes from.
(this isn't a confirmed answer, this is just me asking a question) wonder if it is possible to use inclusion exclusion to solve this like [52!-(52C1)51!+(52C2)50!-(52C3)49!+...+(52C52)1!]/52! and so it would be 1/0!-1/1!+1/2!-1/3!+1/4!...+1/52! which is super close to the expansion of e^x with x=-1
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Derangements
The probability that the event described occurs is the number of configurations with C i = C i ′ , divided by the total number of possible configurations. From the information in the problem, we see that the total number of configurations is 5 2 ! = 8 0 6 5 8 1 7 5 1 7 0 9 4 3 8 7 8 5 7 1 6 6 0 6 3 6 8 5 6 4 0 3 7 6 6 9 7 5 2 8 9 5 0 5 4 4 0 8 8 3 2 7 7 8 2 4 0 0 0 0 0 0 0 0 0 0 0 0 , quite a lot. Now, the possible configurations satisfying C i = C i ′ can be found by the formula for subfactorials/derangements:
! n = ⌊ e n ! + 2 1 ⌋
Using this formula, we see that ! 5 2 = 2 9 6 7 2 4 8 4 4 0 7 7 9 5 1 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 . Then, the probability of the magician finding a configuration satisfying C i = C i ′ is
8 0 6 5 8 1 7 5 1 7 0 9 4 3 8 7 8 5 7 1 6 6 0 6 3 6 8 5 6 4 0 3 7 6 6 9 7 5 2 8 9 5 0 5 4 4 0 8 8 3 2 7 7 8 2 4 0 0 0 0 0 0 0 0 0 0 0 0 2 9 6 7 2 4 8 4 4 0 7 7 9 5 1 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ≈ 0 . 3 6 7 8 7 9 4 4 1 1 7 = 3 6 . 7 8 7 9 4 4 1 1 7 %