MathCastle
Groups and FieldsSuperchallengeThe Sylow Theorems

The Sylow Theorems · Superchallenge problem

A simple group has order 168168. If it had a subgroup of index kk, the action on the kk cosets would give an embedding G↪SkG\hookrightarrow S_k (the kernel must be trivial, since GG is simple and the action is non-trivial for k>1k>1), forcing ∣G∣|G| to divide k!k!. What is the SMALLEST integer kk for which k!≥168k! \ge 168?