Search results
Results from the WOW.Com Content Network
In theoretical physics, the logarithmic Schrödinger equation (sometimes abbreviated as LNSE or LogSE) is one of the nonlinear modifications of Schrödinger's equation, first proposed by Gerald H. Rosen in its relativistic version (with D'Alembertian instead of Laplacian and first-order time derivative) in 1969. [1] It is a classical wave ...
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.
The graph of the logarithm base 2 crosses the x-axis at x = 1 and passes through the points (2, 1), (4, 2), and (8, 3), depicting, e.g., log 2 (8) = 3 and 2 3 = 8. The graph gets arbitrarily close to the y-axis, but does not meet it. Addition, multiplication, and exponentiation are three of the most fundamental arithmetic operations.
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.
Plot of the logarithmic integral function li(z) in the complex plane from -2-2i to 2+2i with colors created with Mathematica 13.1 function ComplexPlot3D. In mathematics, the logarithmic integral function or integral logarithm li(x) is a special function. It is relevant in problems of physics and has number theoretic significance.
The dilogarithm along the real axis. In mathematics, the dilogarithm (or Spence's function), denoted as Li 2 (z), is a particular case of the polylogarithm.Two related special functions are referred to as Spence's function, the dilogarithm itself:
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), 0 ). In computer science , the iterated logarithm of n {\displaystyle n} , written log * n {\displaystyle n} (usually read " log star "), is the number of times the logarithm function must be iteratively applied ...
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 arithmetic modulo an integer m , the more commonly used term is index : One can write k = ind b a (mod m ) (read "the index of a to the base b modulo m ") for b k ≡ a (mod m ) if b is a primitive ...