Hashing

title

Application of Arithmetic modulo - Discrete Math - Hashing

• hashing: $h(k)=kmodN$
• Pseudo random sequences: use the linear congruential generator (LCG) to generate
  • choose 4 int: modulus m, multiplier a, increment c, seed $x_0$, $2\le a<m$, $0\le c<m$, $0\le x_0<m$
  • $x_0=randomseed$
  • $x_i=(a\cdot x_{i-1}+c)\mathrm{mod}m$