how can we find modulo inverse of a number wrt a number?
To find modulo inverse
@sktg99
This topic is not covered in your course as it is an advanced level topic. It is covered in Competitive Programming course. To give you an idea , there are many ways to find modulo inverse , the simplest of which is the Extended Euclidean Algorithm.
There are other methods as well which work only under some special cases like Fermat’s Theorem.
Also , you can always use the Brute Force method as well as that will always work however the time complexity becomes large.
Rest assured , you will not need to find modulo inverse throughout the span of this course and if you are curious you can read about the above mentioned theorems over the internet.