Modular Multiplicative Inverse

[roeticvampire]

Is your feature request related to a problem? Please describe.
I wanted to add Modular Multiplicative Inverse under the maths directory. Reference

Describe the solution you'd like
Using the Extended Euclidean algorithm, that finds the gcd of two numbers and also their coefficients such that their sum can be equal to the gcd.

Additional context
Waiting to be assigned the issue.

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!