title: Compare division method versus multiplication method for hashing
body: <p>For hashing, I would like to compare division method versus multiplication method disadvantages.</p>
  <p><strong>Multiplication method</strong>: Given that we have hash function <code>f(k)=⌊N×(kA−⌊kA⌋)⌋</code>, where <code>N,k∈Z</code>.</p>
  <p><strong>Division method</strong>:<code>f(k)=k mod N</code> where <code>N,k∈Z</code>?</p>
  <p>A disadvantage of division method is the fact that possibility is higher to get same hash value if <code>N = 2^p, p&gt;=0, p∈Z</code> as this <a href="https://stackoverflow.com/a/21797488/12980888">post</a> explained. How that is avoided please in Multiplication method?</p>
  <p>Why the possibility to get same image using multiplication method (value of hashing that <code>k</code> is mapped to) is very low compared to division method hash function <code>f(k)=k mod N</code> please?</p>