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

I recently found a pretty neat mathematical book entitled How not to be wrong: The power of mathematical thinking by Jordan Ellenberg. The author outlines real-life applications that show how ...

An iterated logarithm theorem is presented for sequences of independent, not necessarily bounded, random variables, the distribution of whose partial sums is related to the standard normal ...

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

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

Logarithm to the base e (approximately 2.7183).

The elliptic curve discrete logarithm problem (ECDLP) lies at the heart of modern public-key cryptography. It concerns the challenge of determining an unknown scalar multiplier given two points on an ...

There was a time not so long ago when calculators weren’t standard equipment for computations. The log() button did not exist, and some math had to be done by hand. John Napier and his logarithm ...