The number of random strings of uniform distribution out of all of the possible strings of bits that are n bits in length is a fraction that would seem to depend upon n. What tools would be used to answer this question?

There are 2 raised to the n possible strings of n bits (some call it 2**n). The number of possible strings versus the number of bits in each is (2**n)/n. This ratio gets widely larger as n increases. What happens to the fraction of them that could pass the most thorough test of randomness for a uniform distribution?

I'm sorry to say, I don't know how to start.

Thank you for your help.

Jim Adrian

There are 2 raised to the n possible strings of n bits (some call it 2**n). The number of possible strings versus the number of bits in each is (2**n)/n. This ratio gets widely larger as n increases. What happens to the fraction of them that could pass the most thorough test of randomness for a uniform distribution?

I'm sorry to say, I don't know how to start.

Thank you for your help.

Jim Adrian

Last edited: