Given an odd modulus m, one can compute a/2^k mod m by finding the modular inverse i of 2^k and then compute a*i mod m.
Is there a better way to perform a modular right shift? Is it possible to avoid computing i? What if m was prime? What if k was one?