How many ways is there that we can arrange A,B,C as if they do not position themselves ?
Note that:
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.
From the derangement theorem we can write , => !3 = 2 ! 3 ! - 3 ! 3 ! => !3 = 3 - 1 => !3 = 2 So, the Answer is: 2
Note that: