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

where and are auxiliary hash functions.

- If and m have a common divisor, then not all of the table
is probed.
- Let and = odd number
- m = prime number,
{0, 1, ..., m-1}.

For example, = k mod m

= 1 + (k mod m') where m' = m - 1. - Since each pair yields different probe sequences, the number of sequences is , which is closer to ideal.