3n base operations. These are you three states. Represented by
0, 1, 2.
so taking a 2 trinary digit input: or 32 =9 possibilities.
00 01 02
10 11 12
20 21 22
for 33 =27 possibilities with a 3 trinary digit input.
000 001 002
010 011 012
020 021 022
100 101 102
110 111 112
120 121 122
200 201 202
210 211 212
220 221 222
Now for the trinary word: 34 assuming that we want a span of 4
digits to hold trinary values. 81 possibilities for a word
value.
0000 0001 0002 1000 1001 1002 2000 2001 2002
0010 0011 0012 1010 1011 1012 2010 2011 2012
0020 0021 0022 1020 1021 1022 2020 2021 2022
0100 0101 0102 1100 1101 0102 2100 2101 2102
0110 0111 0112 1110 1111 1112 2110 2111 2112
0120 0121 0122 1120 1121 1122 2120 2121 2122
0200 0201 0202 1200 1201 1202 2200 2201 2202
0210 0211 0212 1210 1211 1212 2210 2211 2212
0220 0221 0222 1220 1221 1222 2220 2221 2222
Each square of trits- trinary digits are 3x3 squares for easy
reading.
The 3n seems to have 9 as a factor in the higher orders from n=3
to n= 4. I'll see what n=5 comes out as. As in how many digit
combinations to form 5 input trinary.
00000 00001 00002 01000 01001 01002 02000 02001 02002
00010 00011 00012 01010 01011 01012 02010 02011 02012
00020 00021 00022 01020 01021 01022 02020 02021 02022
00100 00101 00102 01100 01101 01102 02100 02101 02102
00110 00111 00112 01110 01111 01112 02110 02111 02112
00120 00121 00122 01120 01121 01122 02120 02121 02122
00200 00201 00202 01200 01201 01202 02200 02201 02202
00210 00211 00212 01210 01211 01212 02210 02211 02212
00220 00221 00222 01220 01221 01222 02220 02221 02222
10000 10001 10002 11000 11001 11002 12000 12001 12002
10010 10011 10012 11010 11011 11012 12010 12011 12012
10020 10021 10022 11020 11021 11022 12020 12021 12022
10100 10101 10102 11100 11101 11102 12100 12101 12102
10110 10111 10112 11110 11111 11112 12110 12111 12112
10120 10121 10122 11120 11121 11122 12120 12121 12122
10200 10201 10202 11200 11201 11202 12200 12201 12202
10210 10211 10212 11210 11211 11212 12210 12211 12212
10220 10221 10222 11220 11221 11222 12220 12221 12222
20000 20001 20002 21000 21001 21002 22000 22001 22002
20010 20011 20012 21010 21011 21012 22010 22011 22012
20020 20021 20022 21020 21021 21022 22020 22021 22022
20100 20101 20102 21100 21101 21102 22100 22101 22102
20110 20111 20112 21110 21111 21112 22110 22111 22112
20120 20121 20122 21120 21121 21122 22120 22121 22122
20200 20201 20202 21200 21201 21202 22200 22201 22202
20210 20211 20212 21210 21211 21212 22210 22211 22212
20220 20221 20222 21220 21221 21222 22220 22221 22222
243 possibilities. Still has 9 as a factor 27 times. Don't know
what pragmatic use this has. But it does make an easy square grid
pattern.
The binary in use from 22=4 and 25=32 possibilities.
n=2
00 01
10 11
n=3
000 001
010 011
100 101
110 111
n=4
0000 0001
0010 0011
0100 0101
0110 0111
1000 1001
1010 1011
1100 1101
1110 1111
n=5
00000 00001
00010 00011
00100 00101
00110 00111
01000 01001
01010 01011
01100 01101
01110 01111
10000 10001
10010 10011
10100 10101
10110 10111
11000 11001
11010 11011
11100 11101
11110 11111
