When.com Web Search

  1. Ad

    related to: rules for solving logarithmic equations calculator showing steps

Search results

  1. Results From The WOW.Com Content Network
  2. List of logarithmic identities - Wikipedia

    en.wikipedia.org/wiki/List_of_logarithmic_identities

    The identities of logarithms can be used to approximate large numbers. Note that log b (a) + log b (c) = log b (ac), where a, b, and c are arbitrary constants. Suppose that one wants to approximate the 44th Mersenne prime, 2 32,582,657 −1. To get the base-10 logarithm, we would multiply 32,582,657 by log 10 (2), getting 9,808,357.09543 ...

  3. Pollard's rho algorithm for logarithms - Wikipedia

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

    To find the needed , , , and the algorithm uses Floyd's cycle-finding algorithm to find a cycle in the sequence =, where the function: + is assumed to be random-looking and thus is likely to enter into a loop of approximate length after steps.

  4. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    The logarithm of a product is the sum of the logarithms of the numbers being multiplied; the logarithm of the ratio of two numbers is the difference of the logarithms. The logarithm of the p -th power of a number is p times the logarithm of the number itself; the logarithm of a p -th root is the logarithm of the number divided by p .

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

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

  7. Slide rule - Wikipedia

    en.wikipedia.org/wiki/Slide_rule

    It has thus been compared with reverse Polish notation (RPN) implemented in electronic calculators. [43] A slide rule requires the user to separately compute the order of magnitude of the answer to position the decimal point in the results. For example, 1.5 × 30 (which equals 45) will show the same result as 1 500 000 × 0.03 (which equals 45 ...

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

  9. Scientific calculator - Wikipedia

    en.wikipedia.org/wiki/Scientific_calculator

    Modern scientific calculators generally have many more capabilities than the original four- or five-function calculator, and the capabilities differ between manufacturers and models. The capabilities of a modern scientific calculator include: Scientific notation; Floating-point decimal arithmetic; Logarithmic functions, using both base 10 and ...