enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Iterated logarithm - Wikipedia

    en.wikipedia.org/wiki/Iterated_logarithm

    Demonstrating log* 4 = 2 for the base-e iterated logarithm. The value of the iterated logarithm can be found by "zig-zagging" on the curve y = log b (x) from the input n, to the interval [0,1]. In this case, b = e. The zig-zagging entails starting from the point (n, 0) and iteratively moving to (n, log b (n) ), to (0, log b (n) ), to (log b (n ...

  3. Pollard's rho algorithm for logarithms - Wikipedia

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

    If the underlying group is cyclic of order, by substituting as and noting that two powers are equal if and only if the exponents are equivalent modulo the order of the base, in this case modulo , we get that is one of the solutions of the equation () = ().

  4. SymPy - Wikipedia

    en.wikipedia.org/wiki/SymPy

    SymPy is an open-source Python library for symbolic computation.It provides computer algebra capabilities either as a standalone application, as a library to other applications, or live on the web as SymPy Live [2] or SymPy Gamma. [3]

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

  6. Logit - Wikipedia

    en.wikipedia.org/wiki/Logit

    If p is a probability, then p/(1 − p) is the corresponding odds; the logit of the probability is the logarithm of the odds, i.e.: ⁡ = ⁡ = ⁡ ⁡ = ⁡ = ⁡ (). The base of the logarithm function used is of little importance in the present article, as long as it is greater than 1, but the natural logarithm with base e is the one most often used.

  7. Index calculus algorithm - Wikipedia

    en.wikipedia.org/wiki/Index_calculus_algorithm

    Each relation contributes one equation to a system of linear equations in r unknowns, namely the discrete logarithms of the r primes in the factor base. This stage is embarrassingly parallel and easy to divide among many computers. The second stage solves the system of linear equations to compute the discrete logs of the factor base.

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

  9. nth root - Wikipedia

    en.wikipedia.org/wiki/Nth_root

    The principal nth root of a positive number can be computed using logarithms. Starting from the equation that defines r as an nth root of x, namely =, with x positive and therefore its principal root r also positive, one takes logarithms of both sides (any base of the logarithm will do) to obtain