Take any string of length $p$, where $p$ is a prime number and $p\geq 3$, and where each character can be any element of a set of characters of length m. How many different bracelets can we make if counted all the rotations of one string ($ABA = AAB = BAA$) as one string and if we counted all reflections of the string as one ($ABC=CBA$)?
Asked
Active
Viewed 28 times
0
-
What have you tried? – Momo Feb 24 '22 at 21:34
-
Is the $n$ in the title and the $m$ in your question supposed to be the same? – WW1 Feb 24 '22 at 21:37
-
I found a recurrence relation for palindromes, but I am having issues counting how many occasions rotations and/or reflections become palindromes – Giorno Feb 24 '22 at 21:39