When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of logarithmic identities - Wikipedia

    en.wikipedia.org/wiki/List_of_logarithmic_identities

    ln(r) is the standard natural logarithm of the real number r. Arg( z ) is the principal value of the arg function; its value is restricted to (− π , π ] . It can be computed using Arg( x + iy ) = atan2 ( y , x ) .

  3. Natural logarithm - Wikipedia

    en.wikipedia.org/wiki/Natural_logarithm

    Area does not change under this transformation, but the region between a and ab is reconfigured. Because the function a/(ax) is equal to the function 1/x, the resulting area is precisely ln b. The number e can then be defined to be the unique real number a such that ln a = 1.

  4. Euler's constant - Wikipedia

    en.wikipedia.org/wiki/Euler's_constant

    The area of the blue region converges to Euler's constant. Euler's constant (sometimes called the Euler–Mascheroni constant) is a mathematical constant, usually denoted by the lowercase Greek letter gamma (γ), defined as the limiting difference between the harmonic series and the natural logarithm, denoted here by log:

  5. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    The derivative of ln(x) is 1/x; this implies that ln(x) is the unique antiderivative of 1/x that has the value 0 for x = 1. It is this very simple formula that motivated to qualify as "natural" the natural logarithm; this is also one of the main reasons of the importance of the constant e.

  6. Logarithmic scale - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_scale

    Semi-log plot of the Internet host count over time shown on a logarithmic scale. A logarithmic scale (or log scale) is a method used to display numerical data that spans a broad range of values, especially when there are significant differences between the magnitudes of the numbers involved.

  7. Logarithmic number system - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_number_system

    An LNS can be considered as a floating-point number with the significand being always equal to 1 and a non-integer exponent. This formulation simplifies the operations of multiplication, division, powers and roots, since they are reduced down to addition, subtraction, multiplication, and division, respectively.

  8. Binary logarithm - Wikipedia

    en.wikipedia.org/wiki/Binary_logarithm

    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]

  9. Napierian logarithm - Wikipedia

    en.wikipedia.org/wiki/Napierian_logarithm

    Napier's "logarithm" is related to the natural logarithm by the relation (⁡)and to the common logarithm by (⁡).Note that ⁡ and ⁡ (). Napierian logarithms are essentially natural logarithms with decimal points shifted 7 places rightward and with sign reversed.