Search results
Results from the WOW.Com Content Network
For example, the logarithm of 1000 to base 10 is 3, because 1000 is 10 to the 3 rd power: 1000 = 10 3 = 10 × 10 × 10. More generally, if x = b y, then y is the logarithm of x to base b, written log b x, so log 10 1000 = 3. As a single-variable function, the logarithm to base b is the inverse of exponentiation with base b.
For example, one can multiply a sine that is less than 0.5 by some power of two or ten to bring it into the range [0.5,1]. After finding that logarithm in the radical table, one adds the logarithm of the power of two or ten that was used (he gives a short table), to get the required logarithm. [1]: p. 36
For example, an audio amplifier will usually have a frequency band ranging from 20 Hz to 20 kHz and representing the entire band using a decade log scale is very convenient. Typically the graph for such a representation would begin at 1 Hz (10 0 ) and go up to perhaps 100 kHz (10 5 ), to comfortably include the full audio band in a standard ...
Logarithms can be used to make calculations easier. For example, two numbers can be multiplied just by using a logarithm table and adding. These are often known as logarithmic properties, which are documented in the table below. [2] The first three operations below assume that x = b c and/or y = b d, so that log b (x) = c and log b (y) = d.
A logarithmic unit is a unit that can be used to express a quantity (physical or mathematical) on a logarithmic scale, that is, as being proportional to the value of a logarithm function applied to the ratio of the quantity and a reference quantity of the same type. The choice of unit generally indicates the type of quantity and the base of the ...
For example, O(2 log 2 n) is not the same as O(2 ln n) because the former is equal to O(n) and the latter to O(n 0.6931...). Algorithms with running time O(n log n) are sometimes called linearithmic. [37] Some examples of algorithms with running time O(log n) or O(n log n) are: Average time quicksort and other comparison sort algorithms [38]
The following is a list of integrals (antiderivative functions) of logarithmic functions. For a complete list of integral functions, see list of integrals. Note: x > 0 is assumed throughout this article, and the constant of integration is omitted for simplicity.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.