From: Jeff Gostin <jgostin@eternal.pha.pa.us>
Date: Fri, 17 Jun 94 13:50:36 PDT
To: cypherpunks@toad.com
Subject: (None)
Message-ID: <940617160624Y4Wjgostin@eternal.pha.pa.us>
MIME-Version: 1.0
Content-Type: text/plain


"Perry E. Metzger" <perry@imsi.com> writes:

> algorithm that factors numbers or even just breaks RSA in O(log(n))
> time or less (where n is the length of the number being factored or
> the public key). I'd offer more, but it would be cruel. If you don't
> know what the notation O(f(n)) means, please don't come back asking.
     Well, I don't know what it means. If you'd care to tell me, even in
mail, I'd like to know. I've been following this thread with interest, but
I don't pretend to follow this X(f(y)) notation all the time. I understand
that it means we are applying function X to the result of f(y)... Anyone
who's passed Trig or Elem. Functions does. I don't understand what
function O(x) represents.


                                          --Jeff
--
======  ======    +----------------jgostin@eternal.pha.pa.us----------------+
  ==    ==        | The new, improved, environmentally safe, bigger, better,|
  ==    ==  -=    | faster, hypo-allergenic, AND politically correct .sig.  |
====    ======    | Now with a new fresh lemon scent!                       |
PGP Key Available +---------------------------------------------------------+