Do all the things like ++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatarSign Up
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple APILearn More
Search - "logarithms"
"Fast" random-number/sample based estimation of logarithms:
The result of rAvg(p) is usually "pretty close" to log(p)/2
rAvg(p, 1000) seems to be the golden number. 100 is a little low, but I've already pasted the code. Eh.
Don't know why it works, or if average results are actually considered "close" for logarithms of e.7