引用
最初由 ambivalence 发布
I don't understand where the n/N >= log f(n) / log f(N) comes from. Also why is e the most efficient number? efficient in what sense? I haven't studied maths for a while, so forgive me if I'm asking silly questions.
All I managed to get is 100000*(1+(m-3))^(n/m) = amout at maturity. Where can I go from there
faint, this problem seems keep come to the surface and refuses to die.
if u take n*N days, u will get that equation. if N is the answer then f(n)^N<=f(N)^n , f(x) is the equation for 1 round with x days. and the initial value doesnt really matter here unless the bank has some charge per day.
btw, this whole thing is a variation of n/N >=log(n)/log(N) and the answer for that is N=e. (1/N is the derivative of log(n)/log(N) when n==N, it can be seen more clearly on a graph)
e is the most efficient number is refering to if a number system is base e, u will need minimun symbols(states) to store a number in general (it's actrually the same problem as the one above). in computer, it means base 3 is most efficient for storing data, base 2 is not that bad also. anything else will waste a lot of states in general.