StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
4869731
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-02-02T00:56:39.453
FavoriteCount
0
LastActivityDate
2011-02-02T00:56:39.453
LastEditDate
LastEditorUserId
0
OwnerUserId
598570
ParentId
4861551
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
Not sure if I understood your problem correctly, but assuming you have a natural number x that can be represented with m (e.g., 20) bits, but you have only arrays of n bits at your disposal (say, bytes, i.e. 8-bit arrays), the amount of arrays you need is simply m/n rounded up to the next natural number. For a number that has 20 digits in binary format, that would be 3 bytes. E.g. if your number is <pre><code>1001 01101100 10110100, </code></pre> you could store it as <pre><code>00001001 01101100 10110100. </code></pre> What you have done is to <ol> <li>(integer-) divide your number by 100000000 (10^1000, or 2^8 in decimal system), write down the remainder, truncate the result</li> <li>(integer-) divide the result of 1. by 100000000, write down the remainder, truncate the result</li> <li>(integer-) divide the result of 2. by 100000000, write down the remainder, truncate the result</li> <li>nothing interesting to do anymore because the result of 3 was 0.</li> </ol> Assuming we talk about natural numbers here, in the decimal system the above would look like this: <pre><code>1. 617652/256 = 2412 remainder 180 (10110100 in binary system) 2. 2412/256 = 9 remainder 108 (01101100 in binary system) 3. 9/256 = 0 remainder 9 (00001101 in binary system) </code></pre> So what you are doing is <pre><code>while (number > 0) { divide number by 2^n remember remainder truncate number } </code></pre> Restoring the original number is left as an exercise :) This is actually a problem that comes up whenever you want to deal with very large integer numbers on the computer. I guess a good place to start looking for further information might be <a href="http://en.wikipedia.org/wiki/Positional_notation" rel="nofollow">http://en.wikipedia.org/wiki/Positional_notation</a>.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow to represent number n (assume base 10) using x bits?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. UStoochin
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POHow to represent number n (assume base 10) using x bits?
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.