Return to the text: How Many Tickets Would You Need?
Sensible Strings
The assumptions
- Strings are 300 letters long, from a 26-letter alphabet.
- At every position, 13 of the 26 letters keep the string sensible (a deliberately generous assumption).
Step 1: all strings
26300 ≈ 3.1 × 10424 (425 drums)
Step 2: sensible strings
13300 ≈ 1.5 × 10334 (335 drums)
Step 3: the share that is sensible
13300 ÷ 26300 = (13 ÷ 26)300 = (1/2)300
2300 ≈ 2.0 × 1090
So one string in about 2 × 1090 is sensible: 90 drums. This is exactly the coin-flip calculation: 300 flips, all heads.
Step 4: compared with the atoms in the universe
1090 ÷ 1080 = 1010 = 10,000,000,000
Ten billion for every atom.
Tickets needed
To have a fair chance of at least one win, you need roughly as many tries as the odds against each try: about 1090. (With exactly that many random tries, the chance of at least one win is about 63 percent; with a tenth as many, about 10 percent.)
Last revised 2026-11-16
Return to the text: How Many Tickets Would You Need?