When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Discrete logarithm - Wikipedia

    en.wikipedia.org/wiki/Discrete_logarithm

    For example, log 10 10000 = 4, and log 10 0.001 = −3. These are instances of the discrete logarithm problem. Other base-10 logarithms in the real numbers are not instances of the discrete logarithm problem, because they involve non-integer exponents. For example, the equation log 10 53 = 1.724276… means that 10 1.724276… = 53.

  3. Extraneous and missing solutions - Wikipedia

    en.wikipedia.org/wiki/Extraneous_and_missing...

    Therefore, the solution = is extraneous and not valid, and the original equation has no solution. For this specific example, it could be recognized that (for the value x = − 2 {\displaystyle x=-2} ), the operation of multiplying by ( x − 2 ) ( x + 2 ) {\displaystyle (x-2)(x+2)} would be a multiplication by zero.

  4. 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 () = ().

  5. Abel–Ruffini theorem - Wikipedia

    en.wikipedia.org/wiki/Abel–Ruffini_theorem

    In mathematics, the Abel–Ruffini theorem (also known as Abel's impossibility theorem) states that there is no solution in radicals to general polynomial equations of degree five or higher with arbitrary coefficients. Here, general means that the coefficients of the equation are viewed and manipulated as indeterminates.

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

  7. List of unsolved problems in mathematics - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    The uniqueness conjecture for Markov numbers [158] that every Markov number is the largest number in exactly one normalized solution to the Markov Diophantine equation. Pillai's conjecture : for any A , B , C {\displaystyle A,B,C} , the equation A x m − B y n = C {\displaystyle Ax^{m}-By^{n}=C} has finitely many solutions when m , n ...

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

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