The name of the 5 oceans of earth are written on 5 adhesive labels. John has to locate each ocean on a large world map. In how many ways can he get all 5 wrong?
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.
In an arrangement, when no element goes to its specified position or all elements go to wrong positions , it's called Derangements .
Let D ( n ) be the number of derangements for n different objects, then D ( n ) = n ! r = 0 ∑ n r ! ( − 1 ) r .
Another form of derangement is D ( n ) = n ! ( 2 ! 1 − 3 ! 1 + 4 ! 1 − ⋯ + ( − 1 ) n n ! 1 ) .
Then, the number of derangements for 5 different objects is D ( 5 ) = 5 ! ( 2 ! 1 − 3 ! 1 + 4 ! 1 − 5 ! 1 ) . = 4 4 .
An unbelievable equation! The result is true. Correct!
Putting the labels on the oceans is a permutation of 5 objects, so there are 5! ways of doing this. Permutations can be written as a product of cycles. For example (1,2,3)(4,5) means 1 -> 2 -> 3 ->1 and 4 -> 5 -> 4; while (1,2,3,4)(5) means 1 -> 2 -> 3 -> 4 -> 1 and 5 -> 5 (unchanged). Usually, cycles of length 1 are not listed explicitly. Now, for all the labels to be incorrect, we must have a permutation with no cycles of length 1 (which is an element that is not moved). For five objects, that leaves permutations of the forms (1,2,3,4,5) and (1,2,3)(4,5). In each case, there are 5! ways of assigning numbers to the cycles, but cycles of length n will occur n times since (1,2,3), (2,3,1), and (3,1,2) are the same permutations. Thus there are 5!/5 = 24 permutations with a single 5-cycle. and 5!/(2x3) = 20 permutations of the form (1,2,3)(4,5). So there are 44 permutations that are completely incorrect.
Awesome explanation. Thank you sir
Yes exactly awesome
Step 1. The number of ways in which all labels are wrong = Total number of ways to arrange labels - Number of ways at least 1 label is correct.
Step 2. Total number of label arrangements: 5!
Step 3. Use PIE to calculate N, the number of way at least 1 label is correct:
Number of ways ocean A is labeled correctly: 1 * 4!
There are 5 oceans
-> 5 * 4! = 5! ways for all the ways to get 1 ocean right.
Number of ways both ocean A and ocean B are labeled correctly: 1 * 1 * 3!
There are 5 * 4 / 2! ways to select oceans A and B
-> 2 ! 3 ! ∗ 5 ∗ 4 = 2 ! 5 ! ways for all the ways to get 2 oceans right.
Number of ways ocean A, B, C are labeled correctly: 1 * 1 * 1 * 2!
There are 3 ! 5 ∗ 4 ∗ 3 5 * 4 * 3 / 3! ways to select oceans A, B, C
-> 3 ! 5 ∗ 4 ∗ 3 ∗ 2 ! = 3 ! 5 ! ways for all the ways to get 3 oceans right.
Similarly, 4 ! 5 ! for all the ways to get 4 oceans right, and 5 ! 5 ! for all the ways to get 5 oceans right.
Using PIE, N = 5! - 2 ! 5 ! + 3 ! 5 ! - 4 ! 5 ! + 5 ! 5 !
Step 4. Our answer is:
5! - N = 5! - 5! + 2 ! 5 ! - 3 ! 5 ! + 4 ! 5 ! - 5 ! 5 ! = 5! (1 - 1 ! 1 ! + 2 ! 1 ! - 3 ! 1 ! + 4 ! 1 ! - 5 ! 1 ! )
= 44
First answer that really explains it, without just repeating a formula we already know. Nice!
2 1 4 5 3 ; 3 1 2 5 4 ; 4 1 2 5 3 ; 5 1 2 3 4
2 1 5 3 4 ; 3 1 4 5 2 ; 4 1 5 2 3 ; 5 1 4 2 3
2 3 1 5 4 ; 3 1 5 2 4 ; 4 1 5 3 2 ; 5 1 4 3 2
2 3 4 5 1 ; 3 4 1 5 2 ; 4 3 1 5 2 ; 5 3 1 2 4
2 3 5 1 4 ; 3 4 2 5 1 ; 4 3 2 5 1 ; 5 3 2 1 4
2 4 1 5 3 ; 3 4 5 1 2 ; 4 3 5 1 2 ; 5 3 4 1 2
2 4 5 1 3 ; 3 4 5 2 1 ; 4 3 5 2 1 ; 5 3 4 2 1
2 4 5 3 1 ; 3 5 1 2 4 ; 4 5 1 2 3 ; 5 4 1 2 3
2 5 1 3 4 ; 3 5 2 1 4 ; 4 5 1 3 2 ; 5 4 1 3 2
2 5 4 1 3 ; 3 5 4 1 2 ; 4 5 2 1 3 ; 5 4 2 1 3
2 5 4 3 1 ; 3 5 4 2 1 ; 4 5 2 3 1 ; 5 4 2 3 1
{0, 1, 2, 9, 44, 265, 1854, 14833, 133496, 1334961, 14684570, 176214841, 2290792932, 32071101049, 481066515734, 7697064251745, 130850092279664, ...} formed a series.
The 11 x 4 = 44 {Answer}
Problem Loading...
Note Loading...
Set Loading...
It's just derangement of 5 which equals 4 4 .
For details about derangements, check out this wiki from Brilliant: Derangements