The cases of \(n\le 3\)  have been resolved previously by somewhat ad hoc methods. The case \(n=1\)  is [1]}, \(n=2\)  is proved in [1]}, and the harder case \(n=3\)  is proved in [3]}. Unsurprisingly, Theorem REF  is a special case of a much stronger result.
