A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 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))

  • This Question is Closed
  1. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    we have seen your post, it's just 1 question away do not repost it so often

  2. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I'm sorry, I will delete the last post.

  3. anonymous
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    f1(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

  4. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.