# Homework Help: Picky questions about Big-O problem (Solution included).

1. Mar 31, 2012

### s3a

1. The problem statement, all variables and given/known data
The problem and its solution is attached.

2. Relevant equations
Big-O notation.

3. The attempt at a solution
I get how to do this problem. The reason I'm making this post is for little details about the constants c and n_0. To my knowledge both c and n_0 have to be greater than 0. For n_0, if you use the definition of natural numbers which excludes 0 then I have no problem. On the other hand, the constant c being any real implies that it can be 0 or a negative number as well which doesn't fit in well with what I have learned.

Am I wrong or is the solution wrong? What are the subtleties here?

File size:
24.9 KB
Views:
116
2. Apr 2, 2012

### Staff: Mentor

O() is used for comparing the computations involved in computer algorithms, where c and no both need to be >0 for it to make sense. Beyond this, I can't say any more.

Seems to be a typo, that cn1.5 should be cn2.5 surely?

3. Apr 4, 2012

### s3a

Yes, that n^(1.5) is a typo but it's not what I'm concerned about. ;)

Ok so, it seems that I must generally either make c > 0 or just let it be any constant including zero (it would technically work for a function that equals 0 and is big O of some other function where c = 0) or take the absolute value of the first function as well as the constant times the second function (which could be any real).

This problem puts no absolute value nor does it restrict c > 0 so having said that, the problem is incomplete, right?

Share this great discussion with others via Reddit, Google+, Twitter, or Facebook