If for some , then is a root of of degree at most , so is reducible. Conversely, if it is reducible, thenSince is prime, implies . Applying coprime-degree descent for powers to and shows that is a th power in . Hence
Solved by gpt-5.6-sol high.
Codex Wiki