A waiter spotted a happy customer which, after finishing his meal, lit a cigar, ignoring the big sign "No smoking allowed."
Approaching the smoker, the waiter asked politely in a soft and friendly voice:
:
"Excuse me, Sir, didn't you happen to notice the sign displayed just in front of you?"
Exhaling a perfect ring of smoke, the jolly fellow quipped:
..." I did, but
M'P MDM DPDBMMD AHDPP."
Rem: the puzzle's encryption was not by a simple substitution code , but rather via N(CODE)=N(TEXT)mod K + L or similar (like F(N)instead of N), where N is the ordinal value of a letter in English ABC and K, L integers to be found.
(In reply to
thoughts by Charlie)
The punchline is correct, and this constitutes a solution.
I have labeled this puzzle D4 and assumed that the solver will approach it from both ends.
If you still want to crack the code, you should try to find F(N), mentioned in the brackets, and bear in mind that it is not a
one-to-one mapping.
I believe that by comparing the source with the encrypted text you
will find the coding procedure and in any case it will be revealed by me within a week.
It is not necessarily n mod k + l, but similar.
re: thoughts.....
