enow.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, consider Z 17 ×. To compute 3 4 in this group, compute 3 4 = 81, and then divide 81 by 17, obtaining a remainder of 13. Thus 3 4 = 13 in the group Z 17 ×. The discrete logarithm is just the inverse operation. For example, consider the equation 3 k ≡ 13 (mod 17). From the example above, one solution is k = 4, but it is not the ...

  3. Exponential function - Wikipedia

    en.wikipedia.org/wiki/Exponential_function

    Exponential functions with bases 2 and 1/2. In mathematics, the exponential function is the unique real function which maps zero to one and has a derivative equal to its value. . The exponential of a variable ⁠ ⁠ is denoted ⁠ ⁡ ⁠ or ⁠ ⁠, with the two notations used interchangeab

  4. Hyperoperation - Wikipedia

    en.wikipedia.org/wiki/Hyperoperation

    As a three-argument function, e.g., (,,) = (,), the hyperoperation sequence as a whole is seen to be a version of the original Ackermann function (,,) — recursive but not primitive recursive — as modified by Goodstein to incorporate the primitive successor function together with the other three basic operations of arithmetic (addition ...

  5. Successor function - Wikipedia

    en.wikipedia.org/wiki/Successor_function

    In mathematics, the successor function or successor operation sends a natural number to the next one. The successor function is denoted by S, so S(n) = n + 1. For example, S(1) = 2 and S(2) = 3. The successor function is one of the basic components used to build a primitive recursive function.

  6. Modular exponentiation - Wikipedia

    en.wikipedia.org/wiki/Modular_exponentiation

    Modular exponentiation is the remainder when an integer b (the base) is raised to the power e (the exponent), and divided by a positive integer m (the modulus); that is, c = b e mod m. From the definition of division, it follows that 0 ≤ c < m. For example, given b = 5, e = 3 and m = 13, dividing 5 3 = 125 by 13 leaves a remainder of c = 8.

  7. Computational complexity of mathematical operations - Wikipedia

    en.wikipedia.org/wiki/Computational_complexity...

    The elementary functions are constructed by composing arithmetic operations, the exponential function (), the natural logarithm (), trigonometric functions (,), and their inverses. The complexity of an elementary function is equivalent to that of its inverse, since all elementary functions are analytic and hence invertible by means of Newton's ...

  8. Exponentiation - Wikipedia

    en.wikipedia.org/wiki/Exponentiation

    For example, 3 5 = 3 · 3 · 3 · 3 · 3 = 243. The base 3 appears 5 times in the multiplication, because the exponent is 5. Here, 243 is the 5th power of 3, or 3 raised to the 5th power. The word "raised" is usually omitted, and sometimes "power" as well, so 3 5 can be simply read "3 to the 5th", or "3 to the 5".

  9. Transcendental equation - Wikipedia

    en.wikipedia.org/wiki/Transcendental_equation

    For example, for , the solutions of ⁡ = are approximately those of () / =, namely = and =. For a graphical solution, one method is to set each side of a single-variable transcendental equation equal to a dependent variable and plot the two graphs , using their intersecting points to find solutions (see picture).