On 19 mar, 07:18, JT <jonas.thornv...@gmail.com> wrote: > Surely someone must found it interesting enough to implement it? > A generic basechanger working in anybase for bijective encoded numbers > would be nice.
Could anyone gifted? mathematician help me encode the positive numbers upon the following bijective (NyaN) form?
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
Here is a start for your attempt to make an algorithm that will encode any decimal number with decimal parts into anybase,(i can't quite get it right but for you guys it should be pieceof a cake). It is maximum two lines of code. http://www.anybase.co.nf/