The proof that every number can be seen as a sum-of-the-products-of-primenumbers is easy. E.g. for 1999:
1999 = 1 + 1 + 1 + ... + 1 (1999 ones).
Since 1 is a prime number 1999 is the sum of prime numbers. (1)
Now replace 43 ones by the number 43
. And 5*17*23 ones by 5*17*23
. Then you get
1999 = 5*17*23 + 43 + 1 (2)
Start writing the number as a sum of ones, choose a number of fitting primes and prime products and replace corresponding groups of ones by the prime products of your choice. So any number can be written as a sum-of-the-products-of-primenumbers in the way of your choice. (3)
10 figures and 22 letters, 32 bytes of 5 bits each.
00000 | 0 | 01000 | 8 | 10000 | H | 11000 | P |
00001 | 1 | 01001 | 9 | 10001 | I | 11001 | R |
00010 | 2 | 01010 | A | 10010 | J | 11010 | S |
00011 | 3 | 01011 | B | 10011 | K | 11011 | T |
00100 | 4 | 01100 | D | 10100 | L | 11100 | U |
00101 | 5 | 01101 | E | 10101 | M | 11101 | W |
00110 | 6 | 01110 | F | 10110 | N | 11110 | Y |
00111 | 7 | 01111 | G | 10111 | O | 11111 | Z |
(4) |