When.com Web Search

  1. Ad

    related to: how to solving logarithms

Search results

  1. Results From The WOW.Com Content Network
  2. 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.

  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. Discrete logarithm - Wikipedia

    en.wikipedia.org/wiki/Discrete_logarithm

    Analogously, in any group G, powers b k can be defined for all integers k, and the discrete logarithm log b a is an integer k such that b k = a. In number theory , the more commonly used term is index : we can write x = ind r a (mod m ) (read "the index of a to the base r modulo m ") for r x ≡ a (mod m ) if r is a primitive root of m and gcd ...

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

  6. Pollard's kangaroo algorithm - Wikipedia

    en.wikipedia.org/wiki/Pollard's_kangaroo_algorithm

    In computational number theory and computational algebra, Pollard's kangaroo algorithm (also Pollard's lambda algorithm, see Naming below) is an algorithm for solving the discrete logarithm problem. The algorithm was introduced in 1978 by the number theorist John M. Pollard , in the same paper as his better-known Pollard's rho algorithm for ...

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

  8. Common logarithm - Wikipedia

    en.wikipedia.org/wiki/Common_logarithm

    In mathematics, the common logarithm (aka "standard logarithm") is the logarithm with base 10. [1] It is also known as the decadic logarithm , the decimal logarithm and the Briggsian logarithm . The name "Briggsian logarithm" is in honor of the British mathematician Henry Briggs who conceived of and developed the values for the "common logarithm".

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