(related to Proposition: Number of Strings With a Fixed Length Over an Alphabet with k Letters)
Since \(S=\underbrace{A\times \ldots\times A}_{n \text{ times}}\), it follows from the fundamental counting principle that
\[|S|=\prod_{1}^n|A|=\prod_{1}^n k=k^n.\]
