00:01
Okay, so here we want to show that the hexmolysmol expansion can be obtained by four blocks of binary digits, right? and so four binary digits is going to be sort of either a one or a zero in four of those in a row.
00:19
And so if we have either a one or zero here, that means we have two options for the first one, and two options for the second, and two for the third, and two for the fourth.
00:30
So the way that we can arrange that is going to end up being 16 different ways that we can arrange having a 1 or 0, right? so this is just probability.
00:45
Conveniently, our hexadecidicidididigits run from 0 up to 15.
00:52
Right? so there are 16 discrete hexadecimal digits 0 through 9 plus abcd, e, and f.
01:01
So if we correspond each of these digits to one of these sort of arrangements of zero and ones, then they should each have a unique digit.
01:18
And so we can do that, right? so if we consider the binary, if we started with all zeros, well, that's going to be equal to, in hexadecimal, the number zero.
01:37
All right, and if we have three zeros and a one, that's equal to one...