Talk:Bit numbering

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing  
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.
 

Include some math[edit]

The article says

This bit numbering method has the advantage that for any unsigned integral data type the value of the number can be calculated by using exponentiation with the bit number and a base of 2.

For easier reading, I propose to add a formula here:
 \sum_{i=0}^{w-1} bit(i) \cdot 2^i
where bit(i) denotes the value of the bit with number i and w denotes the number of bits in total.

I see you already added it, which should be fine. Maybe there is some standard notation? Perhaps I might copy the notation used in Two's complement and other articles: N for the number of bits, and ai for each bit (also seen in Positional notation). Vadmium (talk, contribs) 09:51, 4 December 2012 (UTC).