Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.


JT
Posts:
1,041
Registered:
4/7/12


Re: JS coding
Posted:
Feb 6, 2013 2:15 AM


On 3 Feb, 23:33, Virgil <vir...@ligriv.com> wrote: > In article > <6e315bac9f194ceead907ec7bbe8b...@w7g2000yqo.googlegroups.com>, > > JT <jonas.thornv...@gmail.com> wrote: > > I do not want a counter, i want a general solution to re encode any > > decimal number where anybase(decimal,base) {} > > This is probably why people save code instead of posting it to > > usenet ;D > > The process involves repeated divisions with whole number quotients and > remainder > Example: Convert 99 base 10 to base 8 > > Step 1. 8 into 99 goes 12 times with 3 left over > Step 2. 8 into 12 goes 1 time with 4 left over > Step 3. 8 into 1 goes 0 times with 1 left over > Stop when base goes into dividend 0 times > > Then line up the leftovers from last to first: 1,4,3 > > Result 99(base 10) is 143(base 8) > > Check: 143(base 8) = 1*8^2 + 4*8^1 + 3*8^0 > = 1*64 + 4*8 + 3*1 > = 64 + 32 + 3 > = 99 (base 10) > 
Honestly i thought that you math guys, easily could see howto convert ordinary bases to zeroless NyaN bases. For me it took a week to find the generic algorithm for anybase to write out any number using NyaN base notation, but it was 15 years ago so it probably will take me a week or two.
The annoying thing is that i know that the generic basechanger i wrote for standard base was written so a single line of code could change it to NyaN bases, but i am probably getting old because i think i have to start all over with NyaN algorithm. When i do changes it hangs and without a debugger line for line it is harder.
The generic basechanger is allready working, but how do i get it to write out NyaN bases instead of standard bases.



