Question 96
Let $S$ be a subset with four elements chosen from $\{1,2, \ldots, 10\}$. Michael notes that there is a way to label the vertices of a square with elements from $S$ such that no two vertices have the same label, and the labels adjacent to any side of the square differ by at least $4$. How many possibilities are there for the subset $S$?
Proposed by: James Lin
Proposed by: James Lin