Imagine there're infinitely many monkeys typing on infinitely many typewriters.
If monkeys type at , at which time point is the word almost guaranteed to be typed on infinitely many different scripts?
Give your answer in seconds ( ).
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The word L I T E R A T U R E contains 10 characters, which can be typed by a monkey in 1 second.
Assuming a typical typewriter has 50 keys, when there is only one monkey, the possibility for it to type L I T E R A T U R E in 1 second is
( 5 0 1 ) 1 0 = 9 7 6 5 6 2 5 0 0 0 0 0 0 0 0 0 0 1 .
The probability of the monkey not typing L I T E R A T U R E in 1 second is
1 − 9 7 6 5 6 2 5 0 0 0 0 0 0 0 0 0 0 1 .
We can conclude that, in this case, The chance of not typing L I T E R A T U R E for n monkeys in 1 second is
As n grows, X n gets smaller.As n approaches infinity, the probability X n approaches zero.
Therefore, when there's infinitely many monkeys, it is almost surely that an infinite amount of L I T E R A T U R E will be typed in 1 second , so are the other possible combinations of 10-character words.