Discrete Math: Let f1, f2, g1, g2 be functions from the set N of natural numbers such that g1(n) 0 and g2(n) 0 hold for all n 0. Let f1(n) = O(g1(n)) and f2(n) = O(g2(n)). Use the definition of Big O to prove that f1(n)f2(n) = O(g1(n)g2(n))

Question

Discrete Math: Let f1, f2, g1, g2 be functions from the set N of natural numbers such that g1(n) > 0 and g2(n) > 0 hold for all n > 0. Let f1(n) = O(g1(n)) and f2(n) = O(g2(n)). Use the definition of Big O to prove that f1(n)f2(n) = O(g1(n)g2(n))

anonymous · Answer

BigO is computer science i believe. computer science forum.

anonymous · Answer

Yep I posted the question there too. But of course this is a branch of mathematics too so I just posted it here as well. Thanks.