A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

anonymous

  • 5 years ago

please someone help me solve this: one of these has n stages of nodes and more than 200 000 leaves. show that n satisfies the inequality n> log (base10) 200 007- log(base10) 7 /log(base10) 2 hence find the least possible value of n. thank u :)

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

    is n> log (base10) 200 007- log(base10) 7 /log(base10) 2 the original expression? what does 200 007 means?

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

    i dunno but i think the number of leaves

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

    this was the info given with it A branching plant has stems, nodes, leaves and buds. -there are 7 leaves at each node and at each node, 2 new stems grow. at the end of each final stem, there is a bud one plant with 3 stages of nodes has 15 stems, 7 nodes, 49 leaves and 8 buds. qs: how do i show that the number of leaves on one of those plants with n stages of nodes there are?

  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.