Count of primitive words (Q5952877)

The author counts the primitive words of given length on a finite alphabet, as well as the ``exchangeable'' primitive words on a finite alphabet (a word is noexchangeable primitive if the word obtained by applying any permutation to the letters is still primitive). The first result is well known and can be found in any book on combinatorics on words (a nice survey on related topics is for example: \textit{C. Reutenauer} [Mots circulaires et polynômes irréductibles, Ann. Sci. Math. Qué. 12, 275-285 (1988; Zbl 0686.12010)]. The second result in the paper under review is an easy exercise. Note that the results would have been easier to state, had the author known the Möbius function.