Uniary
1,11,111,1111,11111
Binary
0 coding
0,1,00,01,10,11,000,001,010,011,100
Starndard
0,1,10,11,100,101,110,111,1000,1001,1010
No 0 coding (Add 1 to the 0 coding digits)
(starting with 1 as 0)
1,2,11,12,,21,22,111,112,121,122,211
No Outer 0 (starting with 1 as 0).
1,11,101,111,1001,1011,1101,1111,10001,10011,10101
Cross Coding (This can get complexed)
(missing the first 2 at the negative and 1 at the positive with zero at the the positive)
(0 coding cross Standard).
-000,- 11,- 10,- 01,- 10,(0 point) 10 (0 point),11,100,101,110,111
A propersition..
Input your test number.
Starting with the last digit in Base 11 = Aa use the Jacobi symbol on this number over 11 = Ab and put this number under the test number Using the Jacobi symbol Ac
then the last 2 digits in Base 10 use what these two digits make in Base 11 over 10 and as above.
then the last 3 digits in Base 9 use what these tree digits make in Base 10 over 9....
Then in Base 8...
Base 7
Base 6,
Once at base 5 use base 5 to convert %a in bases 5,4,3,2
Then add (Ab+Ac)+(Bb+Bc)+(Cb+Cc)... = AAa , Put AAa under Aa, Ba ect.. with the Jacobi symbol = Ad, Bd, Cd ect...
Add up Ad to Jd = BBa
Do the same for 0 Coding and no 0 coding making BBb and BBc
now add up BBa to BBc = Z
Donno what use Z is but with some play this base 11 down approach may help with bitwise coding math functions and maybe primality tests.