Return to the text: Nine Versus One
Nine at a Time
The assumptions
- A 26-letter alphabet; every letter equally likely.
- Target length: 300 letters (one sonnet's worth), as in The Sonnet Catalog and the Swarm.
- For proteins: 20 amino acids, 300 positions, as in Counting Protein Chains.
Step 1: possible nine-letter strings
269 = 5,429,503,678,976 ≈ 5.4 × 1012 (about 5.4 trillion)
Listing them all in alphabetical order takes 9 letters each:
5.4 × 1012 × 9 ≈ 4.9 × 1013 letters (about 49 trillion)
Step 2: one letter at a time
300 drums, 26 settings each:
26300 ≈ 3.1 × 10424 (425 drums)
Step 3: nine letters at a time
300 ÷ 9 = 33⅓ chunks, each chunk one of 269 settings:
(269)300/9 = 269 × 300/9 = 26300 ≈ 3.1 × 10424 (425 drums)
Exactly the same number. Regrouping the multiplication doesn't change the product.
Step 4: proteins
20300 ≈ 2.0 × 10390 (391 drums), one amino acid at a time
(209)300/9 = 20300 (391 drums), nine at a time
Same total either way: chunking does not change the odds.
Last revised 2026-11-17
Return to the text: Nine Versus One