title: Hashing with chaining and use table of size `m`
body: <p>I ran into an example in Computer Science Course. </p>
  
  <p>suppose we use Hashing with chaining and use table of size <code>m</code>. the hash function map record with key <code>k</code> into <code>k mod m</code> slot. if we know the record keys is subset of <code>{i^2 | 1 &lt;= i &lt;= 100}</code>, for which  value of  <code>m</code> cost of search is lower in worst case?</p>
  
  <p>a) 11</p>
  
  <p>b) 7</p>
  
  <p>c) 9</p>
  
  <p>d) 12</p>
  
  <p>My TA says (1) is true, but i thin this is false. infact i have no idea how we get this ! any idea?</p>