Infinite Monkey Theorem

The mathematical proof is that considering each key hit as a statistically independent event, the chances of typing a specific text consisting of m characters, on a keyboard with 26 keys, are
1/(26^m).
The chances of not typing this text in any of the first n strings of m characters are:
X=(1-1/(26^m))^n
As the equation shows, as n grows, X gets smaller, and as n approaches infinity, X approaches zero, and therefore, for an infinite number of strings typed (n), the probability of typing the specific text (1-X) is one.
Anyway, this theorem explains how LA Clippers win some games and how I can sometimes, on extremely rare occasions, come up with a barely decent piece of writing.