Hash collisions

Background

Hash collisions can be unavoidable depending on the number of objects in a set and whether or not the bit string they are mapped to is long enough in length. When there is a set of ${\displaystyle n}$ objects, if ${\displaystyle n}$ is greater than ${\displaystyle |R|}$, which in this case ${\displaystyle R}$ is the set of the hash values, a hash collision is guaranteed to occur.