Answers are grounded in this paper and cite their sources.
Let n be a fixed positive integer, and consider an alphabet consisting of the numbers 1, 2, … , n . With this alphabet form all possible k -letter words ( a 1 a 2 … a k ), where k is also fixed. There are evidently n k such words in all.
No takes yet. Share an insight, caveat, or question.
Golomb et al. (1958) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: