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

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

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

We prove the law of the iterated logarithm for a general class of M-estimators which covers in particular robust M-estimators and S-estimators of multivariate location-scatter. We also obtain an ...

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

A scientific calculator has two 'log' buttons on it. These are marked log and ln. The log key is used for calculations of the form \({\log _{10}}x\). For example, to work out that \(\log 10000 = 4\) ...