
It is easy to calculate modulus using this prime (with bitwise operations, it is well known)!
My question is how can we efficiently calculate
, where a and b can both have at most 61 bits.
Mersenne Prime — M61 for Hashing

It is easy to calculate modulus using this prime (with bitwise operations, it is well known)!
My question is how can we efficiently calculate
, where a and b can both have at most 61 bits.