We show that if the first case of Fermat's Last Theorem is false for prime exponent p then p2 divides qp−q for all primes q≤89. The title theorem follows.
For which integers s,t, n=2st does there exist a decomposition of the complete graph on n vertices into n-1 copies of the complete (s,t)-bipartite graph?