I wonder how many bits are required for the number (2^43112609 − 1)?
I tried to search google for something but i didn't find a way to calculate it so i ask you. Ofcourse there is a price for it
Re: How many bits required for 2 ^ 43112609−1
Posted: Thu Sep 22, 2011 9:55 pm
by mandai
There are 8 bits in a byte. A byte can be as large as 255.
The actual space that a number takes in memory depends on the math processor that is being used.
Re: How many bits required for 2 ^ 43112609−1
Posted: Fri Sep 23, 2011 7:40 pm
by MrAksel
Could you give me an example? I have created a 128 bit integer by combining a ULong (low) and a Long(high). How many bits would i need for this type of structure?
Re: How many bits required for 2 ^ 43112609−1
Posted: Fri Sep 23, 2011 7:50 pm
by Axel
You could create your own way to calculate thats not using the operators(like -,+)
But I'm not really into calculating
Re: How many bits required for 2 ^ 43112609−1
Posted: Fri Sep 23, 2011 8:05 pm
by mandai
Your own way could be to use a list of many smaller data types that accurately represent the large number. There are some articles that describe how to work with big numbers.
(2^43112609 − 1)?