I was wondering if there is some elegant way to find the highest possible order of an element in $\displaystyle S_{n}$ (symmetry/ permutation group with elements (1, 2, ..., n)?
See A000793 - OEIS. This function is called Landau's function, and there is no simple or elegant formula for it.