A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
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
 4 years ago
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))

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0we have seen your post, it's just 1 question away do not repost it so often

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I'm sorry, I will delete the last post.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0f1(n) = O(g1(n) .. this means that for all n > N1 f1(n) < g1(n) f2(n) = Og(2(n).. this means that for all n>N2 f2(n) < g2(n) take x = max(N1,N2) then f1(n) < g1(n) for all n>x and f2(n) < g2(n) for all n > x hence multiplying both f1(n)*f2(n) < g1(n)g2(n) for all n > x hence f1(n)f2(n) = O(g1(n)g2(n)) .. hence proved
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.