title: Why must h’’(k) be an integer less than m in double hashing
body: <p>Double hashing takes on the following form:</p>
  <pre><code>h(k)=(h’(k)+ i * h’’(k)) mod m
  </code></pre>
  <p>If m is a table size that is relatively prime to h’’(k), then wouldn’t choosing a h’’(k) value that is a prime number but larger than the table size still makes it relatively prime? Just that for every iteration, the step size wraps around the whole table again. Are there any complications if one does not use h’’(k) to be an integer less than m?</p>