I did not consider including that topic here because you cannot easily solve modular multiplicative inverse if they do not understand the basic principle of modulo. That topic is very interesting and fun to solve. It is similar with Division Algorithm and Euclidean Algorithm.
true. and it is fine to exclude any topic you think is complicated and stick to basics.but you could also include a simple definition of the term. ie. modular multiplicative inverse of a is to find x so that a*x ≡ 1 (mod m)
eg. a = 2, m = 7 => x=4 because 2*4 ≡ 8 ≡ 1 (mod 7)
Quote
I am thinking if I will going to create another post regarding those mathematical concept. Do you think it is a good idea @pooya87?
that would be a great idea. 