The thought up numberline is made of hashmarks, and you have to
partition it to make any sense.
Since the reals is not baseless, but fractions are.
If you wanted to represent a binary 5 as 101 ={{{1111}}1}
that just i hope you can interpretat it, here you have the collection
of hashmarks partitioned into binary base.
There is loss in decomposition of the collection, this will ill
grove weirder with the number of zeros because lack of decomposition
of the squares, you are left with a freaking huge collection that
may
or may not be a square.
Here is another way to partition the hashmarks into bases.
So as you may have guessed
Base 1 5={1,1,1,1,1} unary just hashmarks 5 using symbol
Binary 5={{1,1}{1,1}1}=21
Ternary 5={{1,1,1}1,1} =12
Quaternary 5={{1,1,1,1}1} =11
Senary 5={1,1,1,1,1} =5
Septenary 5={1,1,1,1,1} =5
Octal 5={1,1,1,1,1} =5
Nonary 5={1,1,1,1,1} =5
Decimal 5={1,1,1,1,1} =5
Also notice how the parenthesis denote the digitplace, you see i have
no problem to show how the unary full collection is grouped into
subsets making the base for our symolic representation afterall
1,2,3,4,5,6,7,8,9... and so on are just groupings that our brain
learned howto work with in reality my hashmarks are there. And they
are the only archaic option to symbols.
1,2,3,4,5,6,7,8,9
Have no other archaic representation then
1,11,111,1111,11111,111111,1111111, 11111111,111111111
Unless you chose to partition the collection into subsets
representing
digitplaces which you can see i have done above in thread.
I have not thought about representing base1(unary?) fractionals
becase fractionals is superior to partitioning into base, but
possible .{1}
for 1/3 and 3/9 .{{1,1,1} 9/27 .{{{1,1,1,1,1,1,1,1,1} what do you
think. This is the true nature of numbers collections and cuts, the
number line is just dreamed up. Numbers are baseless we partition
and
create the semantics the collections is interpretated in, not the
other way around. And i show you the simples semantics for numbers.
Collections and cuts.
So when you decode the hashmarks into a zeroless base you will get the
new Naturals
1 =1
2 =2
3 =3
4 =11 3+1
5 =12 3+2
6 =13 3+3
7 =21 6+1
8 =22 6+2
9 =23 6+3
10 =31 9+1
11 =32 9+2
12 =33 9+3
13 =111 9+3+1
14 =112 9+3+2
15 =113 9+3+3
16 =121 9+6+1
17 =122 9+6+2
18 =123 9+6+3
19 =131 9+9+1
20 =132 9+9+2
21 =133 9+9+3
And for fractions.
Binary 1=.2 1/2=.1 2/2=.2 1/4=.(1)1 2/4=.(1)2
Ternary 1=.3 1/3=.1 2/3=.2 1/9=.(1)1 2/9=.(1)2 1/27=.
(2)1 2/27=.(2)2 1/81=.(3)1 2/81=.(3)2
Quaternary 1=.4 1/4=.1 2/4=.2 1/16=.(1)1 2/16=.(1)2
Quinary 1=.5 1/5=.1 2/5=.2 1/25=.(1)1 2/25=.(1)2
Senary 1=.6 1/6=.1 2/6=.2 1/36=.(1)1 2/36=.(1)2
Septenary 1=.7 1/7=.1 2/7=.2 1/49=.(1)1 2/49=.(1)2
Octal 1=.8 1/8=.1 2/8=.2 1/64=.(1)1 2/64=.(1)2
Nonary 1=.9 1/9=.1 2/9=.2 1/81=.(1)1 2/81=.(1)2
Decimal 1=.A 1/10=.1 2/10=.2 1/100=.(1)1 2/100=.(1)2
Ternary maybe the best choice for checking out the results of your
generic recursive base implementation since it fairly easy to follow
what is goin on.
1/3 = .1
2/3 = .2
1/9 = .(1)1
2/9 = .(1)2
1/27 = .(2)1
2/27 = .(2)2
1/81 = .(3)1
2/81 = .(3)2
Counting is a collection of discrete entities ranging from first to
last member (inf
is not member of any set).
The first member in counting numbers in is generally one or 1,
unless
you do not adhere to some headless infinity working collective.
Below you can see sets? of discrete natural items and the summation
of
members that make up a set of countable naturals, as you see they
range from first to last since their countable and they are the
reason
numbers have comparable magnitudes, 1 is the base unit of math it
does
have a comparable magnitude, you can cut it to make fractions, count
it to make sets with comparable magnitudes. The whole idea of
numberline is wrong since 1 do not have any geometric properties/
attributes. It does have a magnitude though since it is divisible
into
fractions, the cuts from fractions also have magnitudes that
comparable to 1. Partitioning into bases is a principle with
geometric
properties, but base one have no other projection than counting from
the first to the last discrete member making up a natural number.
1={1}
2={1,1}
3={1,1,1}
4={1,1,1,1}
5={1,1,1,1,1}
6={1,1,1,1,1,1}
7={1,1,1,1,1,1,1}
8={1,1,1,1,1,1,1,1}
9={1,1,1,1,1,1,1,1,1}
A={1,1,1,1,1,1,1,1,1,1}
If you want attempt to make an algorithm that will encode
any decimal number with decimal parts into zeroless anybase, you can
use my standard base changer below.
It is maximum two lines of code.
http://www.anybase.co.nf/