A common solution is to compute a fixed hash function with a very large range (say, 0 to 2 32 − 1), divide the result by n , and use the division's remainder . If n is itself a power of 2, this can be done by bit masking and bit shifting . When this approach is used, the hash function must be chosen so that the result has fairly uniform distribution between 0 and n − 1, for any value of n that may occur in the application. Depending on the function, the remainder may be uniform only for certain values of n , . odd or prime numbers .
Function & Wedding House consists of two businesses, namely Candle Hire and Decorating and Africa Function Hiring. Together we strive for excellent quality and service. Our main service is decorating for weddings, corporate functions, private functions etc. We also do bridal bouquets and corporate gifts and have a large variety of items that clients can hire for their own functions. We give our expert advice to all clients and brides from near and far to make sure that your function is a once in a life time experience... read more