Let N(n) denote the smallest positive integer N such that xN=e for every element x of the symmetric group Sn, where e denotes the identity permutation. Prove that if n>1,
N(n−1)N(n)={pifnis a power of a prime p1otherwise. Putnamgroup theoryOrdersymmetric group