Time complexity

Question

f(n)=Ω(n),g(n)=O(n)  than  what  is f(n).g(n)

Answer 1

SInce f(n)=Ω(n) ---> f(n) $\geq$ c₁n

and g(n)=O(n) --->  g(n) $\leq$ c₂n   

 f(n).g(n) = Ω(n)   but we can't say anything about Big-oh notation as f(n) can be n².n³,2ⁿ, etc.

Comments

if f(n)= n

and g(n) = 1/n

f(n)g(n) = 1 which is not lower bounded by omega(n)

therefore your statement fails

---

@Niraj Singh 2Usually we consider non-decreasing functions, so the answer is correct.