|
|
back to boardShow all messages Hide all messagesHint Al.Cash 3 May 2009 14:37 This problem isn't hard! Just use Burnside's lemma. One would need Polya enumeration theorem to obtain an explicit formula though. Well, the theorem is a generalization of Burnside's anyway. |
|
|