🚀 go-pugleaf

In article <16397@beta.UUCP> mbr@beta.UUCP (Mike Rose) writes:
>In article <2126@polya.STANFORD.EDU> haddad@polya.UUCP (Ramsey Haddad) writes:
>>Mike Rose (mbr@lanl.gov) told me that he had seen the solution before,
>>that the code was based of the Declaration of Independance, and that
>>he believed that the answer was: DO NOT BREAM THIS.  
>
>Well, actually I didn't see it anywhere, so it's just my guess.

It was unclear from your original personal message to me whether you
had solved it yourself or whether you had been shown it by someone
else.  I was trying to avoid making it appear that you claimed credit
for something that you might not have been claiming credit for.

Anyway.  Working backward from "DO NOT BREAM THIS", Jim Gillogoly
pointed out to me that, indeed, this answer will result if one takes
the original numbers mod 107, yielding the sequence:
 15 31 44 57 68 77 96  7 27 58 64 73  2 35
  D  O  N  O  T  B  R  E  A  M  T  H  I  S

Or as you now word it:

>Denning has a DOI fragment in her book.  It even has the words numbered.
>For numbers past the end, wrap back to the beginning.

Acknowledging your observation that:

> it's the old problem of "how do you know when you've broken the cipher".

I will now, nevertheless, consider this to be solved.

Thanks everyone,

-- 
Ramsey W Haddad