(algorithm)

**Definition:**
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.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 24 August 2009.

HTML page formatted Mon Mar 5 14:59:20 2018.

Cite this as:

Paul E. Black, "multiplication method", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 24 August 2009. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/multiplicationMethod.html