A hash function that uses the first p bits of the key times an irrational number. Formal Definition: h(k) = ⌊ m(k A (mod 1))⌋, where m is usually an integer 2^p and A is an irrational number (or an approximation thereto) 0 < A < 1. The modulo 1 operation removes the integer part of k × A.