TR-MO 2022 Problem 2

For positive integers $k$ and $n$ , we know $k \geq n!$ . Prove that $\phi (k) \geq (n-1)!$

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.