I'm reading a text book about cryptography. The text on RSA encryption uses modular arithmetic. When exercising myself with the materials, I struggled a bit with this.
As far as I understood, when my text book says that $100^3 \equiv 254 \mod 319$, I'm tempted to calculate $(100 * 100 * 100) \% 319$ which indeed yields 254. In this case, I'm using $%$ as in C and many other programming languages: as a 'remainder' operator.
Does this make any mathematical sense? Is this the correct way of performing modular arithmetic?