h(k,i) = (h(k) + i + ) mod m

- Only certain combination of , , and m use the entire hash table.
- h(,0) = h(,0) implies h(,i) = h(,i). This leads to secondary clustering.
- There are only m () distinct probe sequences.

h(,i) = (h(k) + i + ) mod m, = = 1

In this example, the probe sequence is

h(k)

h(k) + 2

h(k) + 6

h(k) + 12

...

What if m = 20?