Fork me on GitHub
Math for the people, by the people.

User login

natural log base

Euler number, Eulerian number, Napier's constant, e
Type of Math Object: 
Major Section: 

Mathematics Subject Classification

33B99 no label found


Maybe I'm thick, but I think the formula offered
should be flanked by a little explanation.
Why would you want to know about large powers
of a number just above 1 ?
The point is that if you have a list of powers
of, say, 1.00000001, there is one such number
close to any four digit decimal below ten.
If now you wish to multiply two such numbers
you take the closest powers, add the indices
and reverse lookup. This gives an *approximate*
multiplication method, and one sees that *approximate*
exponentiation and root extraction can also be carried
out. (If your result exceeds 10 you have some fancy
footwork to do, but we'll leave the reader to figure
that bit)
The only problem with this is the amount of calculation
involved and the fact that you are forever writing rather
insignificant tail digits. So ? You now divide all your
powers by n and truncate to a suitable number of digits.
This makes the number whose log was n the number whose log
is 1 - shortens your results and in no way affects their
use as approximate logs.
Of course, if you want to concatenate calculations in a
big way you have problems of accuracy and precision, but
we'll leave them for another time.

Ivan Sayer

Subscribe to Comments for "natural log base"