Sorry, trying to figure out how to explain this…
There’s 2 options of each digit in binary (0 or 1) which contribute to summation which equals the decimal number.
Each digit is subsequently “worth more”. 1, 2, 4, 8, etc. So the value that’s summed is (0 or 1) x 2 ^ (digit’s place (right to left))
1x2^0, 1x2^1, 1x2^2, 1x2^3
1x1, 1x2, 1x2x2, 1x2x2x2
1, 2, 4, 8
We can use the same idea but instead of 2 options, there’s 27 options (1 for each letter of the alphabet, plus 1 for a “blank”)
The pattern explained above is more generally expressed as
Where by we can get a unique value for each word.
B is 27
a is the “value” (1-26) for each letter
FOX would be (switching to left to right)
6x27^0 + 15x27^1 + 24x27^2
6x1 + 15x27 + 24x27x27
6 + 405 + 17496
So for n letters, you can test n! (n factorial) combinations to see if any equal a “word value”. Fox has 3 letters, so we test 3! (1x2x3) or 6 combinations of any 3 given letters to see if any equal 17907
This make any sense? I expect it’s a lot to absorb all at once. I’m sorry, it makes for a much simpler way to determine what word a set of letters make but it’s conceptually difficult.
I’ll make an example project to show you…