All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General > Cryptography
a2o3t6t7 (Posted on 2003-04-09) Difficulty: 5 of 5
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.)
Solution Puzzle Solution | Comment 14 of 17 |
The string appearing before the mark of interrogation  inclusive of the problem text is constituted  by letters and numbers appearing alternately.
  Each of the letters correspond to the first letter of a word and each of the numbers corresponds to the word length. This rule is also applicable to the problem title itself.

Now considering the problem title, we have: 
a(2)o(3)t(6)t(7), brackets placed for facile understanding.
This solves as: "An Old Tongue Twister"

Knowing this, it is now not very difficult to decode the problem text as:
"How much wood  would a woodchuck chuck, if a woodchuck could chuck wood?"

Edited on February 27, 2022, 11:26 pm
  Posted by K Sengupta on 2022-02-27 23:24:18

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 (13)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information