'How to prove this statement of big o notation?

How to prove this:

  1. 4n = O(8n)
  2. 8n = O(4n)?

So what are the C and n0 values for both cases?

mathbig-o


Solution 1:[1]

From what I remember of the law of logarithms:

logb(xy) = (y)logb(x)

I think this is a good starting point. I'm not going to finish because this is a homework assignment. ;)

UPDATE:

The more I look at it, the more I think that something is missing from the original question. Define what C and n0 are, for starters.

Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source
Solution 1

Related Questions