A logarithm is a mathematical operation that determines how many times a certain number, called the base, is multiplied by itself to reach another number. Because logarithms relate geometric ...

Let $\{X_i\}$ be a sequence of independent, identically distributed nondegenerate random variables and $S_n = \sum^n_{i = 1}X_i$. We consider the question for various ...

[Ihsan Kehribar] points out a clever trick you can use to quickly and efficiently compute the logarithm of a 32-bit integer. The technique relies on the CLZ instruction which counts the number of ...

Logarithms and square root are non-elementary operations frequently used in digital signal processing. In this work, implementation and design of an IP-Core to compute square root and multibase ...

Finkelstein's (1971) functional law of the iterated logarithm for empirical distributions is extended to cases where the empirical distribution is multiplied by a ...

NO practical man ever saw the least difficulty either in the idea of logarithms to a given base or in the use of common logarithms in arithmetical work. But if the practical man becomes inquisitive as ...

In 1614, John Napier published the work that would establish logarithms as a viable means for calculating large numbers, enabling countless advances in the centuries since then. There was a time not ...

Logarithm to the base e (approximately 2.7183).