Proof - the right track?
- From: "RonnyM" <ronnyma@xxxxxxxxxxx>
- Date: 23 Nov 2005 10:38:06 -0800
Assume you want to prove that for any constant k, the expression (log^k
N) == (o(N)).
i.e. cN >= log^k N
=>
c >= log^k N / N
You can always find a 'c' that is larger than the right side when N
grows, no matter k's value.
Corrections?
Thanks.
.
- Follow-Ups:
- Re: Proof - the right track?
- From: andy . twigg
- Re: Proof - the right track?
- From: Pat Farrell
- Re: Proof - the right track?
- Prev by Date: Re: Can someone give me an example of this type of problem?
- Next by Date: Re: Proof - the right track?
- Previous by thread: gre practice booklet (computer science)
- Next by thread: Re: Proof - the right track?
- Index(es):