We call a positive integer n≥4 beautiful if there exists some permutation {x1,x2,…,xn−1} of {1,2,…,n−1} such that {x11, x22, …,xn−1n−1} gives all the residues {1,2,…,n−1} modulo n. Prove that if n is beautiful then n=2p, for some prime number p. abstract algebranumber theorycomplete residue system