From: jpp@jpplap.markv.com (Jay Prime Positive)
Date: Fri, 27 May 94 22:38:52 PDT
To: cypherpunks@toad.com
Subject: Re: (fwd) Re: NSA Helped Yeltsin Foil 1991 Coup
Message-ID: <m0q7G9i-0003paC@jpplap>
MIME-Version: 1.0
Content-Type: text/plain


   Date: Fri, 27 May 94 18:54 PDT
   From: jpp@jpplap.markv.com (Jay Prime Positive)

   Infact, the birthday paradox just about garantees
   that the number is less than E1*E2*E3.

After thinking about it some more, I think I would like to rephrase
that.  I don't think 2^k is nearly close enough to ((2^k)!)^(1/2) for
me to say 'garantee'.  But, it is possible for E1*E2*E3 to excede the
number of permutations of the e1( e2( e3( x ))) system.

j(no i am not a tmp tenticle)'