Consider the problem :
Given . How many subsets S' of 4 different elements can we make, such S' contain no consecutive numbers?
I like to show that this problem is equivalent with finding the number of solutions of:
I'm not seeing any connection yet. A little insight please?