How can we distribute n things to r objects such that an object may not receive a thing at all?
N objects are arranged in a row. What are the number of ways of selecting 3 different objects so that none of them are next to each other?