perplexus.info :: Cryptography : a2o3t6t7

Home > General > Cryptography

a2o3t6t7 (Posted on 2003-04-09)

h3m4w4w5a1w9c5i2a1w9c5c5w4?

See The Solution Submitted by Bryan

Rating: 2.7143 (14 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

Word code

| Comment 7 of 17 |

It is a sequence with numbers and letters.
The letter is the first letter of the word.
The number is the number of letters in the word.
Title=An old tongue twister
Problem=How much wood would a woodchuck chuck if a woodchuck could chuck wood?

Posted by Tim Axoy on 2003-04-09 14:07:22

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info