So I think I understand how to calculate something like $(208\cdot 2^{-1})\mod 421$ using extended euclidean algorithm. But how would you calculate something like $(208\cdot2^{-21})\mod 421$?
Thanks, this is basically for my cryptography class; I'm just trying to understand the "big step, baby step" algorithm.