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

Answer 1

n >

log (base10) 200,007- log(base10) 7 /log(base10) 2; <-2?

Answer 2

ohhh....i see it now; wierd format...

Answer 3

log (base10) is normally just written as "log"

Answer 4

log(200,007) - log(7) / log(2)

Answer 5

log(200,007/7)
------------- = 14.80 id say 15
log(2)

Answer 6

7(2^14 - 1) = 114,681

Answer 7

n is greater than 15 at least :)

Answer 8

7 * ((2^15) - 1) = 229,369 is good i mean

Answer 9

i kept punching in 14 instead of 15 lol

Answer 10

amistre Ure great...do u ever joining IMO?

Answer 11

i joined when i was a carpenter :)

Answer 12

haha..i'm sure u get medal on international math. olympiad?

Answer 13

huh?
7(2^14-1)=114681??
why did you divide it by 10000?
:S

Answer 14

i dint know i did

Answer 15

7 times [(2^14) - 1] equals 114681 right?

Answer 16

log(a)-log(b) log(a/b)
---------- = --------
log(c) log(c)

Answer 17

internation math olympiad eh...... i wonder what that would be like :)

Answer 18

...its for high school studentlol

Answer 19

haha
may i ask ur email so we can share about math.

Answer 20

tony031172@gmail.com

Answer 21

thx mine tianpradana@gmail.com

Answer 22

thanks :)