A theorem related to the hash function

If k is a string of 2 ^ p base composition
and m = 2 ^ p - 1
then h (k) = k mod m
arranged each character k does not affect the hash value h (k)