enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Natural logarithm - Wikipedia

    en.wikipedia.org/wiki/Natural_logarithm

    The natural logarithm of e itself, ln e, is 1, because e 1 = e, while the natural logarithm of 1 is 0, since e 0 = 1. The natural logarithm can be defined for any positive real number a as the area under the curve y = 1/x from 1 to a [4] (with the area being negative when 0 < a < 1). The simplicity of this definition, which is matched in many ...

  3. List of logarithmic identities - Wikipedia

    en.wikipedia.org/wiki/List_of_logarithmic_identities

    The identities of logarithms can be used to approximate large numbers. Note that log b (a) + log b (c) = log b (ac), where a, b, and c are arbitrary constants. Suppose that one wants to approximate the 44th Mersenne prime, 2 32,582,657 −1. To get the base-10 logarithm, we would multiply 32,582,657 by log 10 (2), getting 9,808,357.09543 ...

  4. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    For example, the chart at the right compresses the steep increase from 1 million to 1 trillion to the same space (on the vertical axis) as the increase from 1 to 1 million. In such graphs, exponential functions of the form f(x) = a · b x appear as straight lines with slope equal to the logarithm of b.

  5. Prime-counting function - Wikipedia

    en.wikipedia.org/wiki/Prime-counting_function

    In mathematics, the prime-counting function is the function counting the number of prime numbers less than or equal to some real number x. [1] [2] It is denoted by π(x) (unrelated to the number π). A symmetric variant seen sometimes is π 0 (x), which is equal to π(x) − 1 ⁄ 2 if x is exactly a prime number, and equal to π(x) otherwise.

  6. Binary logarithm - Wikipedia

    en.wikipedia.org/wiki/Binary_logarithm

    [11] [36] However, for logarithms that appear in the exponent of a time bound, the base of the logarithm cannot be omitted. 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]

  7. Lambert W function - Wikipedia

    en.wikipedia.org/wiki/Lambert_W_function

    The product logarithm Lambert W function plotted in the complex plane from −2 − 2i to 2 + 2i The graph of y = W(x) for real x < 6 and y > −4. The upper branch (blue) with y ≥ −1 is the graph of the function W 0 (principal branch), the lower branch (magenta) with y ≤ −1 is the graph of the function W −1. The minimum value of x is ...

  8. Common logarithm - Wikipedia

    en.wikipedia.org/wiki/Common_logarithm

    An important property of base-10 logarithms, which makes them so useful in calculations, is that the logarithm of numbers greater than 1 that differ by a factor of a power of 10 all have the same fractional part. The fractional part is known as the mantissa. [b] Thus, log tables need only show the fractional part. Tables of common logarithms ...

  9. Log probability - Wikipedia

    en.wikipedia.org/wiki/Log_probability

    The logarithm function is not defined for zero, so log probabilities can only represent non-zero probabilities. Since the logarithm of a number in (,) interval is negative, often the negative log probabilities are used. In that case the log probabilities in the following formulas would be inverted. Any base can be selected for the logarithm.