How Random Is This Number Really?

By Teresa

Ever stumbled upon a number and wondered, "How random is this number?" You're not alone. In our increasingly digital world, understanding randomness is not just a philosophical musing, but a practical necessity. Whether it's generating secure passwords or understanding the probability of certain events, the concept of randomness is deeply woven into our everyday lives.

some text messages are written in different languages on a screen with the caption that reads, think of a number don't tell it to me double it just say okay when you got it
some text messages are written in different languages on a screen with the caption that reads, think of a number don't tell it to me double it just say okay when you got it

At its core, randomness is about unpredictability. But how can we quantify this? How can we measure the 'randomness' of a number? This is where the concept of entropy, a fundamental measure of randomness, comes into play. In essence, entropy tells us how much 'surprise' or unexpected information we receive from a set of data.

✨
✨

Measuring Randomness: Entropy

Entropy, in information theory, is a measure of the average surprise, or uncertainty, inherent in a set of data. The more unpredictable the data, the higher its entropy. This concept, first introduced by Claude Shannon, has wide-ranging applications, from data compression to cryptography.

an image of numbers and numerals on a white background
an image of numbers and numerals on a white background

In the context of numbers, entropy helps us understand how random a number is. For instance, the number '123456789' has a low entropy because we can predict the next digit with a high degree of certainty. On the other hand, the number '873692451' has a higher entropy because it's less predictable.

Entropy Calculation

an iphone screen with the text call this number it's so cute
an iphone screen with the text call this number it's so cute

Mathematically, entropy (H) of a set of data can be calculated using the Shannon entropy formula: H = -βˆ‘(p\_i * log2(p\_i)), where p\_i represents the probability of each outcome. In the case of a number, each digit's probability of occurrence is 1/10 (assuming it's a digit from 0-9), leading to a theoretical maximum entropy value of log2(10) β‰ˆ 3.32 for a single digit.

However, this doesn't tell the whole story. To understand the randomness of an entire number, we need to consider the mutual information between its digits. This is where algorithms like Lempel-Ziv-Welch (LZW) compression, which measures complexity and randomness, come into play. More on that later.

Uniformity and Randomness

a red poster with the words i dare to call this number 24090 002 and say hello like our feet
a red poster with the words i dare to call this number 24090 002 and say hello like our feet

The uniformity of a number's digits also plays a role in its randomness. A truly random number should have an even distribution of digits. For example, the number '1234567890' is less random than '1472589630' because the former heavily favors the digit '1', reducing its unpredictability.

This is where tools like the DigiTest (Digit Test) come in handy. It assesses the randomness of a number by comparing the frequency of its digits to the expected frequency in a truly random number. The closer the result is to 1.0, the more random the number is.

Beyond Entropy: Measuring Complexity

Patrick!
Patrick!

While entropy is a powerful tool, it has its limitations. For instance, it can't differentiate between a truly random sequence and a sequence generated by a simple rule. To address this, we need to consider measures of complexity.

One such measure is LZW compression. This algorithm works by compressing sequences of data that occur frequently, replacing them with shorter codes. A truly random number, with its lack of patterns or repeated sequences, would compress little to nothing. Thus, the more a number compresses, the less random it is.

That's the wrong number πŸ˜‚πŸ˜‚πŸ˜‚
That's the wrong number πŸ˜‚πŸ˜‚πŸ˜‚
the text reads, this number reads you a story - 3 and there is an image of
the text reads, this number reads you a story - 3 and there is an image of
Guys it actually works! 🀩
Guys it actually works! 🀩
the numbers can you see in this book? - how many numbers can you see?
the numbers can you see in this book? - how many numbers can you see?
an iphone screen with several different types of contacts
an iphone screen with several different types of contacts
just call it……
just call it……
a pink background with the words you just realized think of a number double it add six
a pink background with the words you just realized think of a number double it add six
a poster with the words if a creep wants your number written in black and white
a poster with the words if a creep wants your number written in black and white

LZW Compression and Randomness

To apply LZW compression to numbers, we first convert them into binary sequences. A decimal number '1234567890' becomes '0001110101100001011100111101011000010000010000000110101011100100111101000'.

Running this sequence through an LZW compressor, and then calculating the compression ratio, gives us an idea of the number's complexity, and hence, its 'randomness'. A high compression ratio indicates fewer repeated sequences, i.e., a more random number.

In conclusion, understanding how random a number is involves more than just looking at its digits. Measures like entropy and LZW compression help us quantify and appreciate the nuances of randomness. Whether it's in generating secure passwords or analyzing statistical data, these tools can be invaluable in our quest to make sense of the unpredictable. So, next time you come across a number and wonder, "How random is this number?" you'll have a newfound appreciation for the mathematics behind the magic.