perfect hashing on static data set

- primary number, p, having all static elements, k, in the data set belongs to [0, p-1]

- random number, a, belongs to [1, p-1]

- random number, b, belongs to [0, p-1]

- output set is in length of m

we have function groups, h(k) = ((ak + b)mod p)mod m

two level hashing to make save and access time O(1)

- first level, h(k) = ((ak + b)mod p)mod m

- second level, h2(k) = ((aik + bi)mod p)mod mi, mi = ni^2, ni is number of elements in S