we can do it when hcf(b,m)=1 , in that case find inverse of b by extended euclidean mod m and then multiply it by a
Regards Aviral http://coders-stop.blogspot.com/ On Jan 12, 6:36 am, mittal <mohitm.1...@gmail.com> wrote: > Somehelp with (a/b)modm expression. > > http://en.wikipedia.org/wiki/Modular_arithmetic > i visited this link but found only for addition,subtraction and > multiplication. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
