I have been reading the wiki article about Modular multiplicative inverse and I don't understand it. Can you explain it to me in better way.
To be more specific I am trying to understand the RSA algorithm and I stuck in their working example paragraph 5. I don't understand the math behind this calculation:
The modular multiplicative inverse of $17\pmod{\phi(3233)}$ yielding $2753$.