anonymous
  • anonymous
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 :)
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
is n> log (base10) 200 007- log(base10) 7 /log(base10) 2 the original expression? what does 200 007 means?
anonymous
  • anonymous
i dunno but i think the number of leaves
anonymous
  • anonymous
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?

Looking for something else?

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