Logarithm: Difference between revisions
Moved history of outdated terms to History section. |
Removed the binary, natural, and common logarithm sections, since they repeat a lot of what are in the linked articles for no good purpose. Also unscrambled the sections a lot. |
||
Line 3: | Line 3: | ||
The logarithm [[function (mathematics)|functions]] are the [[inverse function|inverses]] of the [[exponential function]]s. Logarithms convert multiplication to addition, division to subtraction (making them [[isomorphism]]s between the [[field (mathematics)|field]] operations), exponentiation to multiplication, and roots to division (making them crucial to [[slide rule]] construction). |
The logarithm [[function (mathematics)|functions]] are the [[inverse function|inverses]] of the [[exponential function]]s. Logarithms convert multiplication to addition, division to subtraction (making them [[isomorphism]]s between the [[field (mathematics)|field]] operations), exponentiation to multiplication, and roots to division (making them crucial to [[slide rule]] construction). |
||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | A '''double logarithm''' is the inverse function of the [[Exponential_function#Double_exponential_function|double-exponential function]]. A '''super-logarithm''' or '''hyper-logarithm''' is the inverse function of the [[Tetration#Extension_to_real_numbers|super-exponential function]]. The super-logarithm of ''x'' grows even slower than the double logarithm for large ''x''. |
||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
==Usage== |
==Usage== |
||
Line 25: | Line 16: | ||
For [[integer]]s ''a'' and ''b'', the number log<sub>''b''</sub>''a'' is [[irrational number | irrational]] (i.e., not a quotient of two integers) if one of ''a'' and ''b'' has a [[prime factor]] which the other does not (and in particular if they are [[coprime]] and both greater than 1). |
For [[integer]]s ''a'' and ''b'', the number log<sub>''b''</sub>''a'' is [[irrational number | irrational]] (i.e., not a quotient of two integers) if one of ''a'' and ''b'' has a [[prime factor]] which the other does not (and in particular if they are [[coprime]] and both greater than 1). |
||
⚫ | |||
⚫ | |||
''Main article: [[common logarithm]].'' |
|||
⚫ | |||
The ''denary''', or ''decimal,'' system is that which has the number 10 for its base. In practical computation without electronic calculators or the like, it is more convenient than any other system because of its relation to the ordinary numeral system of arithmetic. For details, including the roles of characteristics and mantissas of base 10 logarithms in computations, see [[common logarithm]]. It was proposed in 1617 by [[Henry Briggs]], then [[Professor]] of [[Geometry]] in [[Gresham College]], [[London]], and afterwards Savilian Professor of Geometry at [[Oxford University]]. Briggs was among the first to recognize the importance of the invention of logarithms, and he made two journeys to Scotland for the purpose of visiting Napier, in consultation with whom he formed his new system - a system distinguished from the original one not only in being founded on the number 10, but also in some important simplifications of theory. |
|||
⚫ | |||
⚫ | |||
Historically, denary logarithms were sometimes called ''Briggsian'' or '''vulgar logarithms'' , but the term which ultimately took hold was ''common logarithms''. Nearly any unstated base of a logarithm, except in certain applications, was assumed to be 10; with the practical use of logarithm tables now rare, this is no longer the case. |
|||
⚫ | |||
===Natural logarithms=== |
|||
⚫ | |||
''Main article: [[natural logarithm]].'' |
|||
⚫ | |||
⚫ | |||
⚫ | |||
There are three widely used bases, so those logarithms are given their own names: [[binary logarithm|binary]] (base 2), [[natural logarithm|natural]] (base ''[[e (mathematical constant)|e]]''), and [[common logarithm|common]] (base 10) logarithms. |
|||
There is a special base ''[[e (mathematical constant)|e]]'' (approximately 2.718281828459045) which has useful properties. The logarithm to this base is called the [[natural logarithm]]. When dealing with the logarithms to the base <math>e</math>, it is common especially to denote <math>\log_e</math> by <math>\ln</math> especially if there is any likelihood that the reader might think that base 10 or base 2 logarithms might be meant. In most pure mathematical work, <math>\log</math> or <math>\ln</math> is used to denote <math>\log_e</math>; in most engineering work, <math>\log</math> means <math>\log_{10}</math>; while in [[information theory]], <math>\log</math> often means <math>\log_2</math>, which is traditionally written as <math>\mathrm{ld}</math> (from the Latin ''logarithmus dualis''), but also sometimes is written as <math>\lg</math>. Whenever a possibility for ambiguity exists, this ambiguity is resolved by explicitly writing out the base. |
|||
Historically, base ''e'' logarithms were sometimes called ''Naperian logarithms'', slightly misleadingly since Napier's system did not have log(1)=0; the term which ultimately took hold was ''natural logarithms''. |
|||
===Binary logarithms=== |
|||
As mentioned, the base used extensively in [[information theory]] and [[computer science]] is the [[binary logarithm]], base 2. It is used frequently because many algorithms and computer applications split items into two sub-items, in the [[Divide and conquer (computer_science)|divide-and-conquer]] manner. Binary logarithms are useful in determining characteristics of the time or space complexity of such algorithms. The base of the logarithm is hardly ever mentioned explicitly when [[Analysis of algorithms|analyzing the asymptotic complexity of algorithms]] in terms of [[Big O notation]], since <math>O(\log_b n) = O(\log_c n)</math> for all valid bases ''b'' and ''c''. [[Shannon's law]] relies on the use of base-2 logarithms when considering the basic unit of information the [[bit]], which is generally the most useful modality. |
|||
===Change of base=== |
===Change of base=== |
||
Line 70: | Line 59: | ||
:<math>\log_{e} 2=0.693147181</math> |
:<math>\log_{e} 2=0.693147181</math> |
||
⚫ | |||
⚫ | |||
A curious coincidence is the approximation log<sub>2</sub>(''x'') ≈ log<sub>10</sub>(''x'') + ln(''x''), accurate to about 99.4% or 2 [[significant digit]]s; this is because <sup>1</sup>/<sub>ln 2</sub> − <sup>1</sup>/<sub>ln 10</sub> is approximately 1 (in fact 1.0084...). The property is demonstrated in all six conversion factors above, arranged in pairs of two: |
A curious coincidence is the approximation log<sub>2</sub>(''x'') ≈ log<sub>10</sub>(''x'') + ln(''x''), accurate to about 99.4% or 2 [[significant digit]]s; this is because <sup>1</sup>/<sub>ln 2</sub> − <sup>1</sup>/<sub>ln 10</sub> is approximately 1 (in fact 1.0084...). The property is demonstrated in all six conversion factors above, arranged in pairs of two: |
||
*2.30 3.32 |
*2.30 3.32 |
||
Line 83: | Line 71: | ||
Another interesting coincidence is that, approximately, log<sub>10</sub>2 = 0.3 (the actual value is about 0.301029995); this corresponds to the fact that, with an error of only 2.4%, 2<sup>10</sup> ≈ 10<sup>3</sup> |
Another interesting coincidence is that, approximately, log<sub>10</sub>2 = 0.3 (the actual value is about 0.301029995); this corresponds to the fact that, with an error of only 2.4%, 2<sup>10</sup> ≈ 10<sup>3</sup> |
||
(i.e. 1024 is about 1000; see also [[Binary prefix]]). |
(i.e. 1024 is about 1000; see also [[Binary prefix]]). |
||
==Tables of logarithms== |
|||
⚫ | Prior to the advent of [[computer]]s and [[calculator]]s, using logarithms meant using tables of logarithms, which had to be created manually. Base-10 logarithms are useful in computations when electronic means are not available. See [[common logarithm]] for details, including the use of characteristics and [[mantissa]]s of common (i.e., base-10) logarithms. |
||
⚫ | In [[1617]], Briggs published the first installment of his own table of common logarithms, containing the logarithms of all integers below 1000 to eight decimal places. This he followed, in [[1624]], by his ''Arithmetica Logarithmica,'' containing the logarithms of all integers from 1 to 20,000 and from 90,000 to 100,000 to fourteen places of decimals, together with a learned introduction, in which the theory and use of logarithms are fully developed. The interval from 20,000 to 90,000 was filled up by [[Adrian Vlacq]], a [[Dutch]] computer; but in his table, which appeared in [[1628]], the logarithms were given to only ten places of decimals. |
||
⚫ | Vlacq's table was later to found to contain 603 errors, but "this cannot be regarded as a great number, when it is considered that the table was the result of an original calculation, and that more than 2,100,000 printed figures are liable to error." (''Athenaeum,'' 15 June 1872. See also the ''Monthly Notices of the Royal Astronomical Society'' for May [[1872]].) An edition of Vlacq's work, containing many corrections, was issued at [[Leipzig]] in [[1794]] under the title ''Thesaurus Logarithmorum Completus'' by [[Jurij Vega]]. |
||
⚫ | Callet's seven-place table ([[Paris]], [[1795]]), instead of stopping at 100,000, gave the eight-place logarithms of the numbers between 100,000 and 108,000, in order to diminish the errors of [[interpolation]], which were greatest in the early part of the table; and this addition was generally included in seven-place tables. The only important published extension of Vlacq's table was made by Mr. Sang [[1871]], whose table contained the seven-place logarithms of all numbers below 200,000. |
||
⚫ | |||
⚫ | Besides the tables mentioned above, a great collection, called ''Tables du Cadastre,'' was constructed under the direction of [[Prony]], by an original computation, under the auspices of the [[France|French]] republican government of the [[1700s]]. This work, which contained the logarithms of all numbers up to 100,000 to nineteen places, and of the numbers between 100,000 and 200,000 to twenty-four places, exists only in manuscript, "in seventeen enormous folios," at the Observatory of Paris. It was begun in [[1792]]; and "the whole of the calculations, which to secure greater accuracy were performed in duplicate, and the two manuscripts subsequently collated with care, were completed in the short space of two years." (''English Cyclopaedia, Biography,'' Vol. IV., article "Prony.") [[Interpolation|Cubic interpolation]] could be used to find the logarithm of any number to a similar accuracy. |
||
⚫ | |||
==Applications in calculus== |
==Applications in calculus== |
||
Line 107: | Line 80: | ||
One can then see that the following formula gives the [[integral]] of a logarithm |
One can then see that the following formula gives the [[integral]] of a logarithm |
||
:<math>\int \log_b (x) \,dx = x \log_b (x) - \frac{x}{\ln b} + C = x \log_b \left(\frac{x}{e}\right) + C</math> |
:<math>\int \log_b (x) \,dx = x \log_b (x) - \frac{x}{\ln b} + C = x \log_b \left(\frac{x}{e}\right) + C</math> |
||
==Logarithms of complex numbers== |
|||
⚫ | |||
==Group theory== |
==Group theory== |
||
In the theory of finite [[group (mathematics)|groups]] there is a related notion of [[discrete logarithm]]. For some finite groups, it is believed that the discrete logarithm is very hard to calculate, whereas discrete exponentials are quite easy. This asymmetry has applications in [[cryptography]]. |
In the theory of finite [[group (mathematics)|groups]] there is a related notion of [[discrete logarithm]]. For some finite groups, it is believed that the discrete logarithm is very hard to calculate, whereas discrete exponentials are quite easy. This asymmetry has applications in [[cryptography]]. |
||
==Double logarithm, super-logarithm== |
|||
⚫ | A '''double logarithm''' is the inverse function of the [[Exponential_function#Double_exponential_function|double-exponential function]]. A '''super-logarithm''' or '''hyper-logarithm''' is the inverse function of the [[Tetration#Extension_to_real_numbers|super-exponential function]]. The super-logarithm of ''x'' grows even slower than the double logarithm for large ''x''. |
||
==History== |
==History== |
||
Line 121: | Line 88: | ||
At first, Napier called logarithms "artificial numbers" and antilogarithms "natural numbers". Later, Napier formed the [[portmanteau]], logarithm, to mean a number that indicates a ratio: λoγoς (''logos'') – ratio – αριθμoς (''arithmos'' or number). Napier chose that because the difference of two logarithms determines the ratio of the numbers for which they stand, so that an arithmetic series of logarithms corresponds to a geometric series of numbers. The term antilogarithm was introduced in the 1800s and, while convenient, its use was never widespread. |
At first, Napier called logarithms "artificial numbers" and antilogarithms "natural numbers". Later, Napier formed the [[portmanteau]], logarithm, to mean a number that indicates a ratio: λoγoς (''logos'') – ratio – αριθμoς (''arithmos'' or number). Napier chose that because the difference of two logarithms determines the ratio of the numbers for which they stand, so that an arithmetic series of logarithms corresponds to a geometric series of numbers. The term antilogarithm was introduced in the 1800s and, while convenient, its use was never widespread. |
||
⚫ | |||
⚫ | Prior to the advent of [[computer]]s and [[calculator]]s, using logarithms meant using tables of logarithms, which had to be created manually. Base-10 logarithms are useful in computations when electronic means are not available. See [[common logarithm]] for details, including the use of characteristics and [[mantissa]]s of common (i.e., base-10) logarithms. |
||
⚫ | In [[1617]], Briggs published the first installment of his own table of common logarithms, containing the logarithms of all integers below 1000 to eight decimal places. This he followed, in [[1624]], by his ''Arithmetica Logarithmica,'' containing the logarithms of all integers from 1 to 20,000 and from 90,000 to 100,000 to fourteen places of decimals, together with a learned introduction, in which the theory and use of logarithms are fully developed. The interval from 20,000 to 90,000 was filled up by [[Adrian Vlacq]], a [[Dutch]] computer; but in his table, which appeared in [[1628]], the logarithms were given to only ten places of decimals. |
||
⚫ | Vlacq's table was later to found to contain 603 errors, but "this cannot be regarded as a great number, when it is considered that the table was the result of an original calculation, and that more than 2,100,000 printed figures are liable to error." (''Athenaeum,'' 15 June 1872. See also the ''Monthly Notices of the Royal Astronomical Society'' for May [[1872]].) An edition of Vlacq's work, containing many corrections, was issued at [[Leipzig]] in [[1794]] under the title ''Thesaurus Logarithmorum Completus'' by [[Jurij Vega]]. |
||
⚫ | Callet's seven-place table ([[Paris]], [[1795]]), instead of stopping at 100,000, gave the eight-place logarithms of the numbers between 100,000 and 108,000, in order to diminish the errors of [[interpolation]], which were greatest in the early part of the table; and this addition was generally included in seven-place tables. The only important published extension of Vlacq's table was made by Mr. Sang [[1871]], whose table contained the seven-place logarithms of all numbers below 200,000. |
||
⚫ | |||
⚫ | Besides the tables mentioned above, a great collection, called ''Tables du Cadastre,'' was constructed under the direction of [[Prony]], by an original computation, under the auspices of the [[France|French]] republican government of the [[1700s]]. This work, which contained the logarithms of all numbers up to 100,000 to nineteen places, and of the numbers between 100,000 and 200,000 to twenty-four places, exists only in manuscript, "in seventeen enormous folios," at the Observatory of Paris. It was begun in [[1792]]; and "the whole of the calculations, which to secure greater accuracy were performed in duplicate, and the two manuscripts subsequently collated with care, were completed in the short space of two years." (''English Cyclopaedia, Biography,'' Vol. IV., article "Prony.") [[Interpolation|Cubic interpolation]] could be used to find the logarithm of any number to a similar accuracy. |
||
⚫ | |||
==Trivia== |
==Trivia== |
||
''log'' is written so frequently in mathematics that it is [[Unicode]] glyph 13266 (㏒). |
|||
==Source== |
==Source== |
Revision as of 20:29, 28 January 2005
In mathematics, if two variables of ab = c are known, the third can be found. The base a is found using a radical and c is found using an exponential function. A logarithm is a function used to find b and is written b = loga(c). For instance, log3(81) = 4 because 34 = 81.
The logarithm functions are the inverses of the exponential functions. Logarithms convert multiplication to addition, division to subtraction (making them isomorphisms between the field operations), exponentiation to multiplication, and roots to division (making them crucial to slide rule construction).
An antilogarithm is used to show the inverse of the logarithm. It is written antilog b and means the same as ab.
A double logarithm is the inverse function of the double-exponential function. A super-logarithm or hyper-logarithm is the inverse function of the super-exponential function. The super-logarithm of x grows even slower than the double logarithm for large x.
Usage

The function logb(x) is defined whenever x is a positive real number and b is a positive real number different from 1. See logarithmic identities for several rules governing the logarithm functions.
Logarithms are useful in order to solve equations in which the unknown appears in the exponent, and they often occur as the solution of differential equations because of their simple derivatives. Furthermore, various quantities in science are expressed by their logarithms; see logarithmic scale for an explanation and a list.
For integers a and b, the number logba is irrational (i.e., not a quotient of two integers) if one of a and b has a prime factor which the other does not (and in particular if they are coprime and both greater than 1).
Logarithms may also be defined for complex arguments. This is explained on the natural logarithm page.
Base systems
When logarithms are used repeately in a work, one base (a in ab = c) is usually defined to be the base. This allows writing log(c) instead of repetitively writing the longer loga(c).
So, in a system of logarithms of which 8 is the base,
There are three widely used bases, so those logarithms are given their own names: binary (base 2), natural (base e), and common (base 10) logarithms.
Change of base
One's choice of base with logarithms is not crucial, because a logarithm can be converted from one base to another quite easily. For example, to calculate the value of a logarithm of a base other than 10, given a table or calculator that can only handle base 10, the following formula changes the base to any chosen base (assuming that a, b, and k are all positive real numbers and that and )
where k is any valid base. Letting k=b gives
To see why this is the case, consider the following equations:
by definition | |
take logs on both sides | |
simplify the left hand side | |
divide by |
In particular we have:
Relationship between binary, natural and common logarithms
A curious coincidence is the approximation log2(x) ≈ log10(x) + ln(x), accurate to about 99.4% or 2 significant digits; this is because 1/ln 2 − 1/ln 10 is approximately 1 (in fact 1.0084...). The property is demonstrated in all six conversion factors above, arranged in pairs of two:
- 2.30 3.32
- .30 .69
- .43 1.44
This comes on top of the reciprocal relations we have:
- 2.30 .43
- .30 3.32
- .69 1.44
Another interesting coincidence is that, approximately, log102 = 0.3 (the actual value is about 0.301029995); this corresponds to the fact that, with an error of only 2.4%, 210 ≈ 103 (i.e. 1024 is about 1000; see also Binary prefix).
Applications in calculus
To calculate the derivative of a logarithmic function, the following formula is used
where ln is the natural logarithm, i.e. with base e. Letting b=e:
One can then see that the following formula gives the integral of a logarithm
Group theory
In the theory of finite groups there is a related notion of discrete logarithm. For some finite groups, it is believed that the discrete logarithm is very hard to calculate, whereas discrete exponentials are quite easy. This asymmetry has applications in cryptography.
History
Joost Bürgi, a Swiss clockmaker in the employ of the Duke of Hesse-Kassel, first conceived of logarithms. The method of natural logarithms was first propounded in 1614, in a book entitled Mirifici Logarithmorum Canonis Descriptio, by John Napier (latinized Neperus), Baron of Merchiston in Scotland, who was born about 1550, and died in 1618, four years after the publication of his memorable invention. This method contributed to the advance of science, and especially of astronomy, by making some difficult calculations possible. Prior to the advent of calculators and computers, it was constantly used in surveying, navigation, and other branches of practical mathematics. Besides their usefulness in computation, logarithms also fill an important place in the higher theoretical mathematics.
At first, Napier called logarithms "artificial numbers" and antilogarithms "natural numbers". Later, Napier formed the portmanteau, logarithm, to mean a number that indicates a ratio: λoγoς (logos) – ratio – αριθμoς (arithmos or number). Napier chose that because the difference of two logarithms determines the ratio of the numbers for which they stand, so that an arithmetic series of logarithms corresponds to a geometric series of numbers. The term antilogarithm was introduced in the 1800s and, while convenient, its use was never widespread.
Tables of logarithms
Prior to the advent of computers and calculators, using logarithms meant using tables of logarithms, which had to be created manually. Base-10 logarithms are useful in computations when electronic means are not available. See common logarithm for details, including the use of characteristics and mantissas of common (i.e., base-10) logarithms.
In 1617, Briggs published the first installment of his own table of common logarithms, containing the logarithms of all integers below 1000 to eight decimal places. This he followed, in 1624, by his Arithmetica Logarithmica, containing the logarithms of all integers from 1 to 20,000 and from 90,000 to 100,000 to fourteen places of decimals, together with a learned introduction, in which the theory and use of logarithms are fully developed. The interval from 20,000 to 90,000 was filled up by Adrian Vlacq, a Dutch computer; but in his table, which appeared in 1628, the logarithms were given to only ten places of decimals.
Vlacq's table was later to found to contain 603 errors, but "this cannot be regarded as a great number, when it is considered that the table was the result of an original calculation, and that more than 2,100,000 printed figures are liable to error." (Athenaeum, 15 June 1872. See also the Monthly Notices of the Royal Astronomical Society for May 1872.) An edition of Vlacq's work, containing many corrections, was issued at Leipzig in 1794 under the title Thesaurus Logarithmorum Completus by Jurij Vega.
Callet's seven-place table (Paris, 1795), instead of stopping at 100,000, gave the eight-place logarithms of the numbers between 100,000 and 108,000, in order to diminish the errors of interpolation, which were greatest in the early part of the table; and this addition was generally included in seven-place tables. The only important published extension of Vlacq's table was made by Mr. Sang 1871, whose table contained the seven-place logarithms of all numbers below 200,000.
Briggs and Vlacq also published original tables of the logarithms of the trigonometric functions.
Besides the tables mentioned above, a great collection, called Tables du Cadastre, was constructed under the direction of Prony, by an original computation, under the auspices of the French republican government of the 1700s. This work, which contained the logarithms of all numbers up to 100,000 to nineteen places, and of the numbers between 100,000 and 200,000 to twenty-four places, exists only in manuscript, "in seventeen enormous folios," at the Observatory of Paris. It was begun in 1792; and "the whole of the calculations, which to secure greater accuracy were performed in duplicate, and the two manuscripts subsequently collated with care, were completed in the short space of two years." (English Cyclopaedia, Biography, Vol. IV., article "Prony.") Cubic interpolation could be used to find the logarithm of any number to a similar accuracy.
To the modern student who has the benefit of a calculator, the work put into the tables just mentioned is a small indication of the importance of logarithms.
Trivia
log is written so frequently in mathematics that it is Unicode glyph 13266 (㏒).
Source
Much of the history of logarithms is derived from The Elements of Logarithms with an Explanation of the Three and Four Place Tables of Logarithmic and Trigonometric Functions, by James Mills Peirce, University Professor of Mathematics in Harvard University, 1873.