Why a numeric system based on a polynomial?
Why not on primes, direct!
...17,13,11,7,5,3,2,1
Any integer prime decomposition is unique.
3== ...000100
15==...0001100
21== ...00010100
0== ...0000000000
1== ...0000000001 (convention: Last digit is always zero, except for the unit quantity. Alternative convention: Last digit is always one, except for the zero quantity. Convention in use is easy to spot, just by looking)
Some recursiviness is needed:
4== ...00000[...00010]0
and so on.
Subscrever:
Enviar feedback (Atom)
1 comentário:
Because additions would be become a nightmare. Imagine you add 49 and 52: [10]0000 + 10000[10]0. How can you figure it out that the result is 101 (in decimal), a prime number, thus 100000000000000000000000000? Primality tests would be required all the time, as well as prime tables.
Working with primes as a numeric system basis would also be nightmare because primes cannot be guessed/computed easily, you have to have a table with them all. And there are infinite primes ... therefore you would have a tremendous work to express large number (both to compute its representation and to write it down).
Nice try!
Regards,
Enviar um comentário