Will work only after merge of euler's totient function
Added Modular Multiplicative Inverse using Fermet-Euler theorem
Receives numbers a and m
Returns smallest positive number x so that ax-1 is evenly divisible by m
Returns 0 if such x does not exist
Checklist
[ ] Your branch is up-to-date with the base branch
[ ] You've included at least one test if this is a new feature
Description of new feature, or changes
Will work only after merge of euler's totient function Added Modular Multiplicative Inverse using Fermet-Euler theorem Receives numbers a and m Returns smallest positive number x so that ax-1 is evenly divisible by m Returns 0 if such x does not exist
Checklist
People to notify
@manrajgrover