(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

proof if f(n) = O(g(n)) then g(n) = O(f(n))

= stands for element of

c is some constant

2. Relevant equations

if f(n) <= c*g(n) then f(n) = O(g(n))

if g(n) <= c*f(n) then g(n) = O(f(n))

3. The attempt at a solution

I tried to go from the left-hand-side(LHS) to the right-hand-side(RHS) but this did not work out

if f(n) <= c_1*g(n) then g(n) <= c_2*f(n)

LHS-> f(n) <= c_1*g(n) multiply both sides by 1/c_1

1/c_1*f(n) <= g(n)... not getting to RHS, this does not work

If anyone can give me a hint what else I could do.

Thanks

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Proof Big-O notation property

**Physics Forums | Science Articles, Homework Help, Discussion**