Tiny tutorial regarding converting base X to decimal(and testing LateX)

[mad1231999]

Let the digits of the number be contained in the n-dimensional vector a, like this:

which is equivalent of the binary number 10011101.

Given the base (2 in this case), the number in decimal can be found using the following equation:



So we can conclude, that this is true:

[Guy1234567890]

Fancy!

[David]

Wait, wut?

[EDevil]

Wait, wut?

Same here. We're probably not that far into logic & formula's

[JayJuly]

Lol, nice use of sigma notation to confuse people .

[Thor23]

I think you've got your vector backwards. If you're indexing the digits like in a typical array, the index would be increasing from left to right, so you would get 185 not 157. You'd have to use to get that.

[mad1231999]

Thank you, didn't think about that. Fixed.

[VirtualPineapple]

*Hits, 'That was easy' button*

[Xeomorpher]

Oi, leave my buttons alone!

[David]

I understood it until you brought the equation, maybe I should go to school for a few more years.

[fl3tching101]

Uhm, lol that's like the most complicated equation ever for converting binary to decimal. I suppose it's cool because it works with any base, but it's kind of useless to memorize that complex series summation when you could probably do the conversion faster using simpler methods to a certain amount of digits. This would be pretty useful for a program to do base conversions though Oh, and for those that are confuzled by that, it's sigma notation for a series, in this case a sum of a series. Not sure when you usually learn series, but we learned them in our Algebra II class, however we were working in Advanced Algebra. So I suppose it's either an Algebra II or Advanced Algebra concept. Basically all it is saying is to plug in i and increment until n is reached and add up all of those sums. You plug in 1, solve, plug in 2, solve, etc and add up all of the solutions.