enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Inverse Symbolic Calculator - Wikipedia

    en.wikipedia.org/wiki/Inverse_Symbolic_Calculator

    A user will input a number and the Calculator will use an algorithm to search for and calculate closed-form expressions or suitable functions that have roots near this number. Hence, the calculator is of great importance for those working in numerical areas of experimental mathematics. The ISC contains 54 million mathematical constants.

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

  4. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    Another example is the p-adic logarithm, the inverse function of the p-adic exponential. Both are defined via Taylor series analogous to the real case. [98] In the context of differential geometry, the exponential map maps the tangent space at a point of a manifold to a neighborhood of that point. Its inverse is also called the logarithmic (or ...

  5. List of integrals of logarithmic functions - Wikipedia

    en.wikipedia.org/wiki/List_of_integrals_of...

    The following is a list of integrals (antiderivative functions) of logarithmic functions. For a complete list of integral functions, see list of integrals. Note: x > 0 is assumed throughout this article, and the constant of integration is omitted for simplicity.

  6. Binary logarithm - Wikipedia

    en.wikipedia.org/wiki/Binary_logarithm

    For example, O(2 log 2 n) is not the same as O(2 ln n) because the former is equal to O(n) and the latter to O(n 0.6931...). Algorithms with running time O(n log n) are sometimes called linearithmic. [37] Some examples of algorithms with running time O(log n) or O(n log n) are: Average time quicksort and other comparison sort algorithms [38]

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

  8. Inverse function - Wikipedia

    en.wikipedia.org/wiki/Inverse_function

    For example, the inverse of a cubic function with a local maximum and a local minimum has three branches (see the adjacent picture). The arcsine is a partial inverse of the sine function. These considerations are particularly important for defining the inverses of trigonometric functions. For example, the sine function is not one-to-one, since

  9. History of logarithms - Wikipedia

    en.wikipedia.org/wiki/History_of_logarithms

    In his 1748 textbook Introduction to the Analysis of the Infinite, Euler published the now-standard approach to logarithms via an inverse function: In chapter 6, "On exponentials and logarithms", he begins with a constant base a and discusses the transcendental function =. Then its inverse is the logarithm: z = log a y.