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

   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.

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

4. Pollard's rho algorithm for logarithms - Wikipedia

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

   Help; Learn to edit ... logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, analogous to Pollard's rho algorithm to ...

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

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

7. Binary logarithm - Wikipedia

   en.wikipedia.org/wiki/Binary_logarithm

   Because logarithms in different bases differ from each other only by a constant factor, algorithms that run in O(log 2 n) time can also be said to run in, say, O(log 13 n) time. The base of the logarithm in expressions such as O(log n) or O(n log n) is therefore not important and can be omitted.