JT
Posts:
436
Registered:
4/7/12
|
|
Re: JS coding
Posted:
Feb 6, 2013 3:07 AM
|
|
On 3 Feb, 23:33, Virgil <vir...@ligriv.com> wrote:
> In article
> <6e315bac-9f19-4cee-ad90-7ec7bbe8b...@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)
> --
I now confirmed the code copied from Facebook page works, but not from
google groups, there must be hidden chars or linebreaks.
|
|
