seanieg89
Well-Known Member
- Joined
- Aug 8, 2006
- Messages
- 2,662
- Gender
- Male
- HSC
- 2007
The exact formulae for this class of problems can be found here by the way: http://en.wikipedia.org/wiki/Necklace_(combinatorics).
I have not tried to prove these myself, but the idea would be to separately count how many strings are in each equivalence class using elementary number theory.
I have not tried to prove these myself, but the idea would be to separately count how many strings are in each equivalence class using elementary number theory.