When.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 a number is its logarithm to the base of the mathematical constant e, which is an irrational and transcendental number approximately equal to 2.718 281 828 459. [1] The natural logarithm of x is generally written as ln x, log e x, or sometimes, if the base e is implicit, simply log x.

  3. List of logarithmic identities - Wikipedia

    en.wikipedia.org/wiki/List_of_logarithmic_identities

    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.

  4. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    In mathematics, the logarithm to base b is the inverse function of exponentiation with base b. That means that the logarithm of a number x to the base b is the exponent to which b must be raised to produce x. For example, since 1000 = 10 3, the logarithm base of 1000 is 3, or log 10 (1000) = 3.

  5. Gamma function - Wikipedia

    en.wikipedia.org/wiki/Gamma_function

    In mathematics, the gamma function (represented by Γ, capital Greek letter gamma) is the most common extension of the factorial function to complex numbers.Derived by Daniel Bernoulli, the gamma function () is defined for all complex numbers except non-positive integers, and for every positive integer =, () = ()!.

  6. Bertrand's postulate - Wikipedia

    en.wikipedia.org/wiki/Bertrand's_postulate

    All instances of log(x) without a subscript base should be interpreted as a natural logarithm, also commonly written as ln(x) or log e (x Existence of a prime number between any number and its double In number theory , Bertrand's postulate is the theorem that for any integer n > 3 {\displaystyle n>3} , there exists at least one prime number p ...

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

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

  9. Prime number theorem - Wikipedia

    en.wikipedia.org/wiki/Prime_number_theorem

    For example, π(10) = 4 because there are four prime numbers (2, 3, 5 and 7) less than or equal to 10. The prime number theorem then states that x / log x is a good approximation to π ( x ) (where log here means the natural logarithm), in the sense that the limit of the quotient of the two functions π ( x ) and x / log x as x increases ...