Statement 1: the number of ways in which `n` persons can be seated at a round table, so that all shall not have the same neighbours in any two arrangements is `(n-1)!//2.` Statement 2: number of ways of arranging `n` different beads in circles is `(n-1)!//2.`