Abstract

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.