First off I would like to mention that I am absolutely terrible at statistics... so bear with me please.
a sha1 hash is a hexadecimal string of 40 characters, the largest number being:
which if you convert it to a decimal, it becomes around
I don't know what the exact value is or how to obtain it, but lets say that it is
What is the probability that X number of unique strings when hashed with the sha1 algorithm will have every single possible character combination of a sha1 string?
And does this apply for other hashing algorithms too??
Basically is a sequence of 2^160 unique strings guaranteed to generate every possible combination of a sha1 hash?
P.S. if someone has a better title for this question it would be much appreciated, also I am unsure if this is the best place to ask this :/