Let the n things be x1,x2,....xn.
The first choice may be one of these n things, and this is done in nC1 ways.
Suppose x1 is the one chosen. The next two may be chosen – excluding x1 and, the two next to x1 , namely, x2 , xn from the remaining (n – 3) in n−3C2 ways. Of these n−3C2 there are (n – 4) selections when the second two chosen are next to each other, like x3x4,x4x5, ....xn-2xn - 1.
Therefore, the number of ways of selecting the second two after x1 is chosen, so that the two are not next to each other is

The two objects can be relatively interchanged in two ways. Further, the order of the choice of the three is not to be considered. Hence, the number of ways of choice of the three is
