how high can u can without error on 5 fingers

32. And that has what to do with it?

ok how many can u count on 10 fingers
then tell me how many i need to represent a number that is 1x2x4x8x64xwhat even it is

On ten fingers, I can count to 1023.

If it incorporates all lower powers of two, then you need only record the highest power. If that is your goal, why don't you just do it?

i am going to do it later in machine code......
but just wanted to know if i could do that in linux in a few lines
so i dont have to mess with it

If we understood exactly what you wanted, we might be better able to help. But clearly, this thread is going nowhere.

i dont want anything apart from u guyz just to undertand that 1024 numbers can be presented on 10 fingers
so 1024x1024x1024 can number can be reprduced by just know how many tmies u counted on 30 fingers....
but aint 1024x1024x1024 1 gig of data in just 30 fingers

No. You could record any number up to 1 billion in '30 fingers' (30 bits), but that's about it. That 1 billion is less than 4 bytes of data. (aka, the same 30 bits)

so u telling me if i read my whole drive from start to finished and used base 10241024 i could tell u say in less then 30 bits what i got

No. The number of bits of data on your hard drive will be EXACTLY the same, regardless of base.

Base is simply a representation of the data.

so u telling me every thing that stores data actually equeals one 1
as i believe in a seperate thory why u cant open a harddrive..i read it and i can show u.....and it a normal harddrive

i want a favour
big favour ill show u howi do it if u show me ur method too
but it must be shown here
and tell me how to convert it binary back with availble free tools

all i am saying we are paying the ame for the same amouth of fate....just that there profitting from it
as we choose to use there stuff
now i will make a new system if everyone used it freely
and nothing that kids cant see

u can count any number on 5 tho
just read a post at top
no just 32

I think that you are lacking knowledge of data structures.

I will clear you about how you can count a lot of numbers with few bits (just to make sure you understand the last posts that said exactly that):

Say you have 2 bit, you can count: 00, 01, 10, 11 - 4 number
3 bits: 000, 001, 010, 011, 100, 101, 110, 111 - 8 Numbers

So, since the computer works on binary, I can count to 2^n where n is the number of bits I have.

Changing the base has no real relevance for the computer. It will still count everything on binary. It can't do otherwise. So, when you build a HEX or Decimal string this is just so that humans can read this more easely, you are not trully changing the representation in the computer, you are just choosing an output form, like say a font, but inside everything is binary.

A common way of outputing HEX or decimal numbers: use character strings

A character ocuppies 8 bits. you can count up to 255 with that. So when you write "FFA342FBC" you waste space because you counted up to 16 on each character, but you could acctually count up to 255. The same for writting "34534514" (wastes even more) or anything else. Those are just output forms, the computer still sees everything as binary. You can't *really* change the base unless you build a new computer.

Here is a link to learn more about binary: http://en.wikipedia.org/wiki/Binary_numeral_system