When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Common logarithm - Wikipedia

    en.wikipedia.org/wiki/Common_logarithm

    Common logarithm. A graph of the common logarithm of numbers from 0.1 to 100. In mathematics, the common logarithm is the logarithm with base 10. [1] It is also known as the decadic logarithm and as the decimal logarithm, named after its base, or Briggsian logarithm, after Henry Briggs, an English mathematician who pioneered its use, as well as ...

  3. Logarithmic integral function - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_integral_function

    In mathematics, the logarithmic integral function or integral logarithm li (x) is a special function. It is relevant in problems of physics and has number theoretic significance. In particular, according to the prime number theorem, it is a very good approximation to the prime-counting function, which is defined as the number of prime numbers ...

  4. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    Because log(x) is the sum of the terms of the form log(1 + 2 −k) corresponding to those k for which the factor 1 + 2 −k was included in the product P, log(x) may be computed by simple addition, using a table of log(1 + 2 −k) for all k. Any base may be used for the logarithm table. [53]

  5. Log-normal distribution - Wikipedia

    en.wikipedia.org/wiki/Log-normal_distribution

    This is justified by considering the central limit theorem in the log domain (sometimes called Gibrat's law). The log-normal distribution is the maximum entropy probability distribution for a random variate X —for which the mean and variance of ln (X) are specified.

  6. Pollard's rho algorithm for logarithms - Wikipedia

    en.wikipedia.org/wiki/Pollard's_rho_algorithm_for...

    Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, analogous to Pollard's rho algorithm to solve the integer factorization problem. The goal is to compute such that , where belongs to a cyclic group generated by . The algorithm computes integers , , , and such that .

  7. Logarithmic scale - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_scale

    A base-10 log scale is used for the Y axis of the bottom left graph, and the Y axis ranges from 0.1 to 1,000. The top right graph uses a log-10 scale for just the X axis, and the bottom right graph uses a log-10 scale for both the X axis and the Y axis. Presentation of data on a logarithmic scale can be helpful when the data:

  8. Euler's constant - Wikipedia

    en.wikipedia.org/wiki/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: Here, ⌊·⌋ represents the floor function.

  9. Logarithmic mean - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_mean

    Logarithmic mean. Three-dimensional plot showing the values of the logarithmic mean. In mathematics, the logarithmic mean is a function of two non-negative numbers which is equal to their difference divided by the logarithm of their quotient. This calculation is applicable in engineering problems involving heat and mass transfer.