Three couples are standing in a row before Judge Fermat. To make their court case look mathematical, he begins the proceedings by asking one of his barristers to find the number of ways these couples can be arranged such that no one stands next to his/her partner. Find the number of ways that this can be done.
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.
No explanations have been posted yet. Check back later!