enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 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]

  3. Natural logarithm - Wikipedia

    en.wikipedia.org/wiki/Natural_logarithm

    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. [2] [3] Parentheses are sometimes added for clarity, giving ln(x), log e (x), or log(x). This is done particularly when the argument to the logarithm is not a single symbol, so as to prevent ambiguity.

  4. List of logarithmic identities - Wikipedia

    en.wikipedia.org/wiki/List_of_logarithmic_identities

    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. Derivations also use the log definitions x = b log b (x ...

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

  6. Binary logarithm - Wikipedia

    en.wikipedia.org/wiki/Binary_logarithm

    For any x > 0, there exists a unique integer n such that 2 n ≤ x < 2 n+1, or equivalently 12 −n x < 2. Now the integer part of the logarithm is simply n, and the fractional part is log 2 (2 −n x). [58] In other words:

  7. Pollard's rho algorithm for logarithms - Wikipedia

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

    Let be a cyclic group of order , and given ,, and a partition =, let : be the map = {and define maps : and : by (,) = {() + (,) = {+ ()input: a: a generator of G b: an element of G output: An integer x such that a x = b, or failure Initialise i ← 0, a 00, b 00, x 01 ∈ G loop i ← i + 1 x i ← f(x i−1), a i ← g(x i−1, a i−1), b i ← h(x i−1, b i−1) x 2i−1 ← ...

  8. Log–log plot - Wikipedia

    en.wikipedia.org/wiki/Loglog_plot

    A loglog plot of y = x (blue), y = x 2 (green), and y = x 3 (red). Note the logarithmic scale markings on each of the axes, and that the log x and log y axes (where the logarithms are 0) are where x and y themselves are 1. Comparison of linear, concave, and convex functions when plotted using a linear scale (left) or a log scale (right).

  9. Discrete logarithm - Wikipedia

    en.wikipedia.org/wiki/Discrete_logarithm

    Similarly, let b −k denote the product of b −1 with itself k times. For k = 0, the kth power is the identity: b 0 = 1. Let a also be an element of G. An integer k that solves the equation b k = a is termed a discrete logarithm (or simply logarithm, in this context) of a to the base b. One writes k = log b a.