Question 980989
<pre>
Given n things in a certain order, the number of "derangements" or 
ways to rearrange them so that none of them are in the same position
they were in before rearranging is given by the formula !n, known as 
n-subfactorial.

The formula for !n is 

{{{"!n"}}}{{{""=""}}}{{{integer(n!/e+0.5)}}}

So the number of ways no trumpet player gets his or her own trumpet back is

{{{"!4"}}}{{{""=""}}}{{{integer(4!/e+0.5)}}}{{{"=""}}}{{{integer(24/2.718281828+0.5))}}}{{{""=""}}}{{{integer(8.829106588+0.5)}}}{{{""=""}}}{{{integer(9.329106588)}}}{{{""=""}}}{{{9}}}

[Incidentally, FYI, those 9 rearrangements of 

1,2,3,4 are

2,1,4,3
2,3,4,1
2,4,1,3
3,1,4,2
3,4,1,2
3,4,2,1
4,1,2,3
4,3,1,2
4,3,2,1]

The total number of arrangements is 4! = 24.

So the desired probability is 9 ways out of 24.

That's 9/24

Edwin</pre>