Here is a problem I composed, which recently appeared on the Colorado Mathematical Olympiad.
If one wishes to color the integers so that every two integers that differ by a factorial get different colors, what is the fewest number of colors necessary?
I might describe a solution, as well as some related history, in a future post. But for now I’ll just say that Adam Hesterberg solved this problem at Canada/USA Mathcamp a few summers ago, claiming the $20 prize I offered almost as soon as I offered it. At the time, I suspected but still did not know the exact answer.
Although the wording of the problem strongly suggests that the answer is finite, I don’t think that this is entirely obvious.
Along those lines, here is another infinite graph with finite chromatic number.
If one wishes to color the points of the Euclidean plane so that every two points at distance one get different colors, what is the fewest number of colors necessary?
This is one of my favorite unsolved math problems, just for being geometrically appealing and apparently intractably hard. After fifty years of many people thinking about it, all that is known is that the answer is 4, 5, 6, or 7. Recent work of Shelah and Soifer suggests that the exact answer may depend on the choice of set theoretic axioms.
This inspired the following related question.
If one wishes to color the points of the Euclidean plane so that every two points at factorial distance get different colors, do finitely many colors suffice?
More generally, if is a sequence of positive real numbers that grows quickly enough (say exponentially), and one forbids pairs points at distance from receiving the same color, one would suspect that finitely many colors suffice. On the other hand, if grows slowly enough (say linearly), one might expect that infinitely many colors are required.