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 :)

Question

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 :)

anonymous · Answer

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

anonymous · Answer

i dunno but i think the number of leaves

anonymous · Answer

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?