
related topics 
{math, number, function} 
{work, book, publish} 
{math, energy, light} 
{@card@, make, design} 
{rate, high, increase} 
{island, water, area} 
{government, party, election} 
{style, bgcolor, rowspan} 
{album, band, music} 

In mathematics, the logarithm of a number to a given base is the exponent to which the base must be raised in order to produce that number. For example, the logarithm of 1000 to base 10 is 3, because 10 to the power of 3 is 1000: 10^{3} = 1000. The logarithm of x to the base b is written log_{b}(x) such as log_{10}(1000) = 3.
By the following formulas, logarithms reduce products to sums and powers to products:
Three values for the base are used most often. The logarithm with base b = 10 is called the common logarithm; its primary use was for calculations before calculators could handle multiplication, division, powers, and roots effectively. The natural logarithm, with base b = e, occurs in calculus and is the inverse of the exponential function. The binary logarithm with base b = 2 has applications in computing.
Logarithms have a number of generalizations. The complex logarithm, the inverse of the exponential function applied to complex numbers, generalizes the logarithm to complex numbers. The discrete logarithm generalizes it to cyclic groups and has applications in publickey cryptography.
John Napier invented logarithms in the early 17th century, and since then they have been used for many applications in mathematics and science. Logarithm tables were used extensively to perform calculations, until replaced in the latter half of the 20th century by electronic calculators and computers. Logarithmic scales reduce wideranging quantities to smaller scopes; for example the Richter scale. They also form the mathematical backbone of musical intervals and some models in psychophysics, and have been used in forensic accounting. In addition to being a standard function used in various scientific formulas, logarithms are used in determining the complexity of algorithms and of fractals, and in primecounting functions.
Contents
Full article ▸


related documents 
Fast Fourier transform 
Closure (computer science) 
Continued fraction 
Algebraic geometry 
Axiom of choice 
Hilbert's tenth problem 
Tensor product 
Dedekind domain 
Orthogonal matrix 
Adjoint functors 
Singleton pattern 
Variable 
Functional programming 
Combinatorics 
Kolmogorov complexity 
Scheme (programming language) 
Fourier series 
Class (computer science) 
Lie group 
Numeral system 
Calculus 
Design Patterns 
Limit (category theory) 
Riemann integral 
LR parser 
Μrecursive function 
Elliptic curve cryptography 
Original proof of Gödel's completeness theorem 
Binary search tree 
Group theory 
