How many ways are there to color the vertices of a square with $n$ colors $1,2, .. ., n$. (The colorings must be different so that we can’t get one from the other by a rotation.)
Source: 2016 Saudi Arabia BMO TST , level 4, II p4
Tags: combinatorics, Coloring
How many ways are there to color the vertices of a square with $n$ colors $1,2, .. ., n$. (The colorings must be different so that we can’t get one from the other by a rotation.)