When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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 arithmetic modulo an integer m , the more commonly used term is index : One can write k = ind b a (mod m ) (read "the index of a to the base b modulo m ") for b k ≡ a (mod m ) if b is a primitive ...

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

  4. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    The logarithm keys (LOG for base 10 and LN for base e) on a TI-83 Plus graphing calculator. Logarithms are easy to compute in some cases, such as log 10 (1000) = 3. In general, logarithms can be calculated using power series or the arithmetic–geometric mean, or be retrieved from a precalculated logarithm table that provides a fixed precision.

  5. Natural logarithm - Wikipedia

    en.wikipedia.org/wiki/Natural_logarithm

    The natural logarithm of e itself, ln e, is 1, because e 1 = e, while the natural logarithm of 1 is 0, since e 0 = 1. The natural logarithm can be defined for any positive real number a as the area under the curve y = 1/x from 1 to a [4] (with the area being negative when 0 < a < 1). The simplicity of this definition, which is matched in many ...

  6. List of logarithmic identities - Wikipedia

    en.wikipedia.org/wiki/List_of_logarithmic_identities

    The multiple valued version of log(z) is a set, but it is easier to write it without braces and using it in formulas follows obvious rules. log(z) is the set of complex numbers v which satisfy e v = z; arg(z) is the set of possible values of the arg function applied to z. When k is any integer:

  7. Pollard's kangaroo algorithm - Wikipedia

    en.wikipedia.org/wiki/Pollard's_kangaroo_algorithm

    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 solving the same problem. [ 1 ] [ 2 ] Although Pollard described the application of his algorithm to the discrete logarithm problem in the multiplicative group of units modulo a prime p , it is in fact a ...

  8. AOL Mail

    mail.aol.com

    Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!

  9. Iterated logarithm - Wikipedia

    en.wikipedia.org/wiki/Iterated_logarithm

    In computer science, lg * is often used to indicate the binary iterated logarithm, which iterates the binary logarithm (with base ) instead of the natural logarithm (with base e). Mathematically, the iterated logarithm is well defined for any base greater than e 1 / e ≈ 1.444667 {\displaystyle e^{1/e}\approx 1.444667} , not only for base 2 ...