When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Logarithm

    The logarithm of a product is the sum of the logarithms of the numbers being multiplied; the logarithm of the ratio of two numbers is the difference of the logarithms. The logarithm of the p-th power of a number is p times the logarithm of the number itself; the logarithm of a p-th root is the logarithm of the number divided by p. The following ...

  3. 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). Log(z) is the principal value of the complex logarithm function and has imaginary part in the range (−π, π].

  4. Natural logarithm - Wikipedia

    en.wikipedia.org/wiki/Natural_logarithm

    The natural logarithm function, if considered as a real-valued function of a positive real variable, is the inverse function of the exponential function, leading to the identities: ⁡ = + ⁡ = Like all logarithms, the natural logarithm maps multiplication of positive numbers into addition: [ 5 ] ln ⁡ ( x ⋅ y ) = ln ⁡ x + ln ⁡ y ...

  5. 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 ...

  6. Prime number theorem - Wikipedia

    en.wikipedia.org/wiki/Prime_number_theorem

    The first such distribution found is π(N) ~ ⁠ N / log(N) ⁠, where π(N) is the prime-counting function (the number of primes less than or equal to N) and log(N) is the natural logarithm of N. This means that for large enough N , the probability that a random integer not greater than N is prime is very close to 1 / log( N ) .

  7. Logarithmic growth - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_growth

    Logarithmic growth is the inverse of exponential growth and is very slow. [2] A familiar example of logarithmic growth is a number, N, in positional notation, which grows as log b (N), where b is the base of the number system used, e.g. 10 for decimal arithmetic. [3] In more advanced mathematics, the partial sums of the harmonic series

  8. Logarithmic number system - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_number_system

    A logarithmic number system (LNS) is an arithmetic system used for representing real numbers in computer and digital ... where the "sum" function is defined by () ...

  9. Prime-counting function - Wikipedia

    en.wikipedia.org/wiki/Prime-counting_function

    An equivalent statement is ⁡ = where li is the logarithmic integral function. The prime number theorem was first proved in 1896 by Jacques Hadamard and by Charles de la Vallée Poussin independently, using properties of the Riemann zeta function introduced by Riemann in 1859.