A combinatorics Le Monde mathematical puzzle: In the set {1,…,12}, numbers adjacent to i are called friends of i. How many distinct subsets of size 5 can be chosen under the constraint that each number in the subset has at least a friend with him? In a brute force approach, I tried a quintuple loop