Problem:
Let be a subset with four elements chosen from . Michael notes that there is a way to label the vertices of a square with elements from such that no two vertices have the same label, and the labels adjacent to any side of the square differ by at least . How many possibilities are there for the subset ?
Proposed by: James Lin
, 2018
Solution
Solution:
Let the four numbers be around the square. Assume without loss of generality that is the largest number, so that and . Note that cannot be simultaneously smaller than one of and larger than the other because, e.g. if , then and . Hence is either smaller than and or larger than and .
Case 1: is smaller than and . Then we have , but when , we have , so we need , giving the only set .
Case 2: is larger than and . Since and are both at most , the range of possible values for is . When , there are choices for respectively and for and respectively (remember that order of and does not matter). So there are sets in this case.
Therefore we have possible sets in total.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.