> 1) I seem to remember from CS240 that there was a definition of Big-O
> that used limits.  I don't have my CS240 notes on me, and I forgot the
> definition.  I think it was something like f is O(g) if lim_n->inf(f/g)
> <= 1, which I think makes intuitive sense.  I'm not sure though.  Does
> anyone have these?  They look to be really useful.
>
> 2) What is (log^2)n?  I'm presuming it's (logn)^2.
>
> 3) Since I haven't touched Math138 for over a year (and barely touched
> it even when I was taking it), I've completely forgotten my sequences
> and series.  Does anyone know the rule about the series n^k for k from 1
> to inf?  It was something like n < 0 -> series converges, but was there
> any more to it?
>
> Thanks.  If I've said too much about any of the solutions, feel free to
> moderate me, as I'm kinda getting back into the swing of newsgroups, and
> never really used one for a non-programming course...
>
> Lyle